Bit manipulation solves problems cleanly when you recognize binary structure in the problem. XOR's cancellation property and n&(n-1) for lowest bit are the two most powerful techniques.
You'll reach for bit manipulation when you see "pairs cancel," "power of ," or "no extra space" constraints. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.