# Minimum Number Of Refueling Stops: Interview Notes
Minimum Number Of Refueling Stops shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Drive as far as the current fuel allows, storing every passed station in a max-heap of fuel. Whenever you would run dry, pop the richest station you already passed and count a stop. If the heap is empty you fail.
## 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
Greedily stopping at every station, which overcounts stops, or only looking ahead one station.
## 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 this tool.