# Reconstruct Itinerary: Interview Notes
Reconstruct Itinerary shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Hierholzer: from each airport always take the lex-smallest unused ticket, then append the airport after exploring (post-order reverse is the tour).
## 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/DFS, union-find, topological sort, or tree 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(E log E) with a min-heap per node.
## Common mistake
A plain DFS that does not delete used edges, or sorting tickets only once globally.
## 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.