# Minimum Speed To Arrive On Time: Explained
Minimum Speed To Arrive On Time shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary search integer speed; every train except the last rounds up to a whole hour.
## 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 answer, sliding window, stack, or in-place rewrite) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n log 1e7).
## Common mistake
Rounding the last train up as well.
## 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 Linkjob.ai.