# K Empty Slots: Explained

K Empty Slots shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

n bulbs bloom on day flowers[i]; find the earliest day when two blooming bulbs are exactly k slots apart with everything between still empty. Walk bloom days left-to-right and track, in a tree set of bloomed positions, the nearest bloomed neighbor; or use a sliding window of size k+1 on the day[] array (min of the interior > max of the two ends).

## 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

Checking every pair of bloomed bulbs each day (O(n^2)) or allowing a bloom inside the window.

## 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 www.linkjob.ai.