# Reorder Routes To Make All Paths Lead To The City Zero: Interview Notes
Reorder Routes To Make All Paths Lead To The City Zero shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build an undirected adjacency list but remember which edges were originally outgoing; DFS/BFS from 0 and count every edge that still points away from 0.
## 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(n).
## Common mistake
Reversing every edge in the input, which also flips edges that already pointed toward 0.
## 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.