Count the number of 1-bits in an integer.
Check if n is a power of two.
Every element appears twice except one. Find it.
Reverse the bits of a 32-bit unsigned integer.
Count positions where corresponding bits of two integers differ.
Return the bitwise AND of all numbers in range [m, n].