# Meeting Rooms III: Practice Notes
Meeting Rooms III shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort meetings by start. Keep a min-heap of free room ids and a min-heap of (end, room) for busy rooms. On each meeting, free every room that has finished; if one is free take the lowest id, otherwise delay the meeting to the earliest-ending room and keep that room. Count bookings per room.
## 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(m log n + m log m).
## Common mistake
Always assigning room 0 when several rooms are free, or forgetting to delay a meeting that starts while all rooms are busy.
## 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 multilingual AI interview assistant.