Bitwise AND of Numbers Range
Single Number II. Count the number of 1 for each bit.
Number of 1 Bits. Simple right shift operation, no secret.
Single Number. It is one of the most classic bit manipulation problem. X XOR X = 0
Divide Two Integers. The core observation in my solution is for any number n, n << 1 == n * 2 (with the assumption that there is no overflow.) So…