Given airline tickets (from, to), reconstruct the itinerary that uses every ticket exactly once, starting from "JFK". If several itineraries work, return the lexicographically smallest one (as a list of airports). A valid itinerary always exists.
Unlock this and every premium problem across all tracks — plus hidden-test grading, advanced AI engineering modules and new content every week.
Start 7-day free trial