Count of values of x <= n for which (n XOR x) = (n – x)
Given an integer n, the task is to find the number of possible values of 0 ≤ x ≤ n which satisfy n XOR x… Read More »
Category Archives: Bit Magic
Check if the binary representation of a number has equal number of 0s and 1s in blocks
Given an integer N, the task is to check if its equivalent binary number has the equal frequency of consecutive blocks of 0 and 1.… Read More »
First and Last Three Bits
Given an integer N. The task is to print the decimal equivalent of the first three bits and the last three bits in the binary… Read More »
Largest number less than X having at most K set bits
Given an integer X > 1 and an integer K > 0, the task is to find the greatest odd number < X such that… Read More »
Minimum absolute difference between N and a power of 2
Given an integer N, the task is to find the minimum absolute difference between N and a power of 2. Examples: Input: N = 4… Read More »
Represent n as the sum of exactly k powers of two | Set 2
Given two integers n and k, the task is to find whether it is possible to represent n as the sum of exactly k powers… Read More »
Occurrences of a pattern in binary representation of a number
Given a string pat and an integer N, the task is to find the number of occurrences of the pattern pat in binary representation of… Read More »
Smallest power of 2 which is greater than or equal to sum of array elements
Given an array of N numbers where values of the array represent memory sizes. The memory that is required by the system can only be… Read More »
Count number of step required to reduce N to 1 by following certain rule
Given a positive integer . Find the number of steps required to minimize it to 1. In a single step N either got reduced to… Read More »
Find k numbers which are powers of 2 and have sum N | Set 1
Given two numbers N and K. The task is to print K numbers which are powers of 2 and their sum is N. Print -1… Read More »
Pairs from an array that satisfy the given condition
Given an array arr[], the task is to count all the valid pairs from the array. A pair (arr[i], arr[j]) is said to be valid… Read More »
Minimum number of operations required to sum to binary string S
Given a binary string S. Find the minimum number of operations required to be performed on the number zero to convert it to the number… Read More »
Count of numbers which can be made power of 2 by given operation
Given a array arr[], the task is to count the numbers which can be made power of 2 with the following operation: 1 can be… Read More »
Number of pairs whose sum is a power of 2
Given an array arr[] of positive integers, the task is to count the maximum possible number of pairs (arr[i], arr[j]) such that arr[i] + arr[j]… Read More »
Sum of elements from an array having even parity
Given an array arr[], the task is to calculate the sum of the elements from the given array which has even parity i.e. the number… Read More »