# Total Hamming Distance: Walkthrough
Total Hamming Distance shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
For each of the 32 bit positions count how many numbers have that bit set (c) and add c*(n-c), the pairs that differ on that bit.
## 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(32n).
## Common mistake
Computing Hamming distance for every pair, which is O(n^2).
## 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 learn more.