# Chinese Postman Undirected Tour: Interview Notes
Chinese Postman Undirected Tour shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Add a minimum-weight pairing of odd-degree vertices (via matching on shortest-path distances) so the multigraph is Eulerian and Hierholzer yields a shortest closed tour.
## 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^3) dominated by the matching on odd vertices.
## Common mistake
Pairing odd vertices by a greedy nearest neighbor, which can be far from a minimum-weight pairing.
## 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 copilot.