# The Number Of The Smallest Unoccupied Chair: Interview Notes

The Number Of The Smallest Unoccupied Chair shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort friends by arrival. Hold free chair ids in a min-heap and occupied chairs in a min-heap of (leaveTime, chair). At each arrival free every chair whose leaving time is due, then assign the smallest remaining chair id; return the target friend's chair.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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

Assigning chairs in arrival order without reclaiming earlier leavers, which overuses large ids.

## 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 undetectable AI interview copilot.