# Bus Routes: Interview Notes
Bus Routes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS on buses (or stops): from a stop, ride each unused route to every stop it covers; mark routes used so each is enqueued once.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(total stops on routes).
## Common mistake
BFS on stops while re-scanning every route at every stop, which is far slower.
## 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.