12.01 · Problem

Reconstruct Itinerary

Hard Eulerian path (Hierholzer's algorithm) 1 video LC 332 Pro

This problem is part of solulu Pro

Each ticket [from, to] is a flight. All tickets belong to one traveller who starts at "JFK". Use every ticket exactly once and return the itinerary. If several itineraries are valid, return the one that is…

Lifetime ~~₹1,999~~ ₹999 · Launch offer

Mark this problem as solved when you are finished.

Item 93 of 150 · updated 2026-10-12