# Minimum Number Of K Consecutive Bit Flips: Explained
Minimum Number Of K Consecutive Bit Flips shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Greedy: when you see a 0 that is not already flipped an odd number of times, start a flip of length k; a difference array or a deque tracks flip parity.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, 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
Actually flipping the next k bits in the array each time, which is O(nk).
## 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.ai.