Count number of bits to be flipped to convert A to B | Set-2
Given two integers A and B, the task is to count the number of bits needed to be flipped to convert A to B. Examples:… Read More »
Category Archives: Bit Magic
Count Set-bits of number using Recursion
Given a number N. The task is to find the number of set bits in its binary representation using recursion. Examples: Input : 21 Output… Read More »
Count smaller elements on right side and greater elements on left side using Binary Index Tree
Given an array arr[] of size N. The task is to find smaller elements on the right side and greater elements on the left side… Read More »
Equal Sum and XOR of three Numbers
Given an integer N. The task is to count the numbers of pairs of integers A and B such that A + B + N… Read More »
Find the number of pair of Ideal nodes in a given tree
Given a tree of N nodes and an integer K, each node is numbered between 1 and N. The task is to find the number… Read More »
Bit manipulation | Swap Endianness of a number
Prerequisite: https://www.geeksforgeeks.org/little-and-big-Endian-mystery/ Little Endian and Big Endian are ways or storing data in machines. Some machines might use Little Endian byte ordering while others might… Read More »
Find two integers A and B such that A ^ N = A + N and B ^ N = B + N
Given a non-negative integer N, the task is to find two integers A (greatest integer smaller than N) and (smallest integer greater than N) such… Read More »
Quadruplet pair with XOR zero in the given Array
Given an array arr[] of N integers such that any two adjacent elements in the array differ at only one position in their binary representation.… Read More »
Find maximum xor of k elements in an array
Given an array arr[] of N integers and an integer K. The task is to find the maximum xor subset of size K of the… Read More »
Alternate XOR operations on sorted array
Given an array arr[] and two integers X and K. The task is to perform the following operation on array K times: Sort the array.… Read More »
Minimum Bitwise OR operations to make any two array elements equal
Given an array arr[] of integers and an integer K, we can perform the Bitwise OR operation between any array element and K any number… Read More »
Count total set bits in all numbers from 1 to n | Set 2
Given a positive integer N, the task is to count the sum of the number of set bits in the binary representation of all the… Read More »
Longest Subarray having strictly positive XOR
Given an array arr[] of N non-negative integers. The task is to find the length of the longest sub-array such that XOR of all the… Read More »
Number formed by the rightmost set bit in N
Given an integer N, the task is to find an integer M formed by taking the rightmost set bit in N i.e. the only set… Read More »
Count number of set bits in a range using bitset
Given a large binary number.The task is to count the number of 1’s in a given range from L to R (1 based indexing). Examples:… Read More »
