Skip to content

Category Archives: Bit Magic

Maximize total set bits of elements in N sized Array with sum M
Expert
Given two integers N and M denoting the size of an array and the sum of the elements of the array, the task is to… Read More
setBitCount
Bit Magic
Generate an Array with XOR of even length prefix as 0 or 1
Basic
Given an integer N, the task is to construct an array of N distinct elements (arr[i] ≤ N+1) such that the bitwise XOR of every… Read More
Bitwise-XOR
Arrays
Bit Magic
Count ordered pairs of Array elements such that bitwise AND of K and XOR of the pair is 0
Given an array arr[] of size N and an integer K, the task is to find the count of all the ordered pairs (i, j)… Read More
Bitwise-AND
Bitwise-XOR
Arrays
Bit Magic
Find square root of a number using Bit Manipulation
Medium
Given a non-negative integer N, the task is to find the square root of N using bitwise operations. If the integer is not the perfect… Read More
Picked
Bit Magic
Mathematical
Count of possible pairs whose sum and bitwise XOR is given
Given two integers S and X representing the sum and bitwise XOR respectively of two integers, the task is to find the count of all… Read More
Bitwise-XOR
permutation
Bit Magic
Check if any Array pair has bitwise XOR greater than bitwise AND
Given an array arr[] of size N, the task is to find if there exists a pair in the array, such that their bitwise XOR… Read More
Bitwise-AND
Bitwise-XOR
Arrays
Bit Magic
Maximize Bitwise XOR of K with two numbers from Array
Given an integer K and an array arr[] of size N, the task is to choose two elements from the array in such a way… Read More
Bitwise-XOR
Trie
Arrays
Bit Magic
Count of cells in Binary Matrix having equal bitwise XOR of that row and column
Given a binary matrix arr[][] of N rows and M columns. The task is to find the number of cells in the matrix, where Bitwise… Read More
Bitwise-XOR
Bit Magic
Greedy
Matrix
Add an element in Array to make the bitwise XOR as K
Given an array arr[] containing N positive integers, the task is to add an integer such that the bitwise Xor of the new array becomes… Read More
Bitwise-XOR
Bit Magic
School Programming
Count of x in given range such that bitwise XOR of x, (x+1) and (x+2), (x+3) are equal
Medium
Given an integer N, the task is to count the number of integers (say x) in the range [0, 2N−1] such that x⊕(x+1) = (x+2)⊕(x+3).… Read More
Bitwise-XOR
Bit Magic
Count number of 0s in base K representation of a number
Given a number N, the task is to find the number of zero’s in base K representation of the given number, where K > 1.… Read More
Bit Magic
Mathematical
Minimize subtraction of power of 2 to convert N to 0
Given a positive integer N, the task is to find the minimum number of subtractions of power of 2 required to convert N to 0.… Read More
setBitCount
Bit Magic
Find all M in range [2, N] such that bitwise OR till M is equal to the value till M-1
Basic
Given an integer N, the task is to find all possible integer M in the range [2, N] such that the bitwise OR of all… Read More
Bitwise-OR
Bit Magic
Count all triplets from given Array whose bitwise XOR is equal to K
Given an array arr[] which contains N positive integers and an integer K. The task is to count all triplets whose XOR is equal to… Read More
Binary Search
Bitwise-XOR
Arrays
Bit Magic
Sorting
Minimize steps to make two integers equal by incrementing them or doing bitwise OR of them
Given two positive integers A and B. The task is to make them equal using minimum operations such that:  A = A + 1 (increase… Read More
Bitwise-OR
Bit Magic
Greedy

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox

Start Your Coding Journey Now!