# Maximum Consecutive Floors Without Special Floors: Walkthrough
Maximum Consecutive Floors Without Special Floors shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Floors bottom..top; special floors cannot be used. The longest consecutive run of non-special floors is the max gap between consecutive sorted specials (special[i+1] - special[i] - 1), also considering bottom..first and last..top.
## 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 log n).
## Common mistake
Using special[i+1] - special[i] without subtracting 1 (that counts an endpoint special) or forgetting the prefix/suffix gaps to bottom and top.
## 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.