Reconstruct Itinerary

Euler path on a directed graph — the hardest graph variant Netflix tests. Hierholzer's algorithm with post-order insertion teaches how to traverse every edge exactly once without getting stuck.

Enable JavaScript for the full StreamPrep guide.