Bit Manipulation problems, grouped by pattern

Bit tricks turn some problems into one line. XOR cancels pairs, n & (n - 1) clears the lowest set bit, and shifting checks any single bit. Worth knowing for the missing and repeated number family.

When to reach for it

  • Every element appears twice except one
  • Check, set or count bits
  • Constant extra space is required

Mistakes to watch for

  • Sign issues with >> vs >>> in Java
  • Operator precedence of & vs ==
  • Assuming 32-bit ints hold every value

The 25 problems

4Missing / Repeated Numbers

5Sum over Subsets (SOS) DP

6Math / Number Theory