# The Latest Time To Catch A Bus: Practice Notes

The Latest Time To Catch A Bus shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort buses and passengers. Greedily fill each bus in order. The latest time is the last empty slot just before a departure that is not taken by a passenger, or one less than a taken time, staying positive and unused.

## 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+m) log (n+m)).

## Common mistake

Answering with the last bus's departure without checking if that time is already taken.

## 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 AI assistant for technical interviews.