Replace bits in a number.
Bit representation of a double.
Nearest integer with equal number of 1's.
Test if n is a power of 2 or 0.
Bit conversion.
Swap odd and even bits with as few instructions as possible.
Find the missing number in O(n) time.