# K Empty Slots Revisited: Walkthrough
K Empty Slots Revisited shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Same as K Empty Slots: day[pos] = bloom day. A sliding window of size k+2 (two ends blooming, interior later) finds the earliest day max(day[left], day[right]) when the interior's min bloom day is strictly later.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Using a set of bloomed positions incorrectly so a later bloom inside the window is missed.
## 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 try it free.