# Reverse Bits: Explained
Reverse Bits shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Walk 32 bit positions and accumulate (n&1) onto the result shifted the other way, or swap the 16-bit halves then 8, 4, 2, and 1-bit pairs.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(1).
## Common mistake
Stopping after the last 1-bit and dropping the leading zeros that should become trailing zeros.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.