Bit Manipulation

Find the element that appears only once when all others appear twice using XOR

Count the number of set bits (1s) in a binary number (Hamming Weight)

Return array where ans[i] is the number of 1s in binary of i

Reverse bits of a 32-bit unsigned integer

Find the missing number in array [0, n] using XOR

Check if a number is a power of two

Add two integers without using + or - operators

Find element appearing once when others appear 3 times

Find two elements appearing once when others appear twice

Find bitwise AND of all numbers in range [left, right]

Flip all bits in binary representation

Check if a number is a power of four

Check if binary has alternating bits (101010...)

Count differing bit positions between two numbers

Find maximum XOR of any two numbers in array

Generate Gray code sequence where adjacent values differ by one bit

Generate all subsets using a bitmask from 0..(2^n - 1)

Sort by popcount (number of 1 bits), then by value

Find how many bits differ between start and goal

Minimum flips to make (a | b) equal to c

Use bitwise trie to maximize xor value