# Counting Bits: Practice Notes
Counting Bits shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
dp[i] = dp[i>>1] + (i&1), or dp[i] = dp[i & (i-1)] + 1. Each new value reuses a previously computed Hamming weight.
## 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(n).
## Common mistake
Calling a popcount per index independently, which hides the linear DP reuse.
## 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 https://www.linkjob.ai/.