bit manipulation (operating on binary representations) operates directly on binary representations using bitwise operators (AND, OR, XOR, NOT, shifts). You use it when problems involve powers of , binary properties, or require space solutions. XOR is particularly powerful: a^a=0 and a^0=a enable clean solutions.
You'll see this in single-number problems, flags, and low-level optimization. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.
