# Category Archives: Bit Magic

Given an integer N denoting the size of an array and two arrays containing Bitwise AND and Bitwise OR of adjacent elements of the array… Read More
Given an array Arr[] of N integers and an integer K, the task is to find if it is possible to make the count of… Read More
Given an array A[] of positive integers, print all the unique non-empty subsets of the array  Note: The set can not contain duplicate elements, so… Read More
Given two integers X and Y, and an integer K, the task is to find the minimum number of operations to make X equal to… Read More
Given three positive integers X, Y, and Z and an integer N, the task is to make them equal by adding 2i-1 for the ith… Read More
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
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
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
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
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
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
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
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
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
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