Solution: Reconstruct Itinerary
Explore how to reconstruct an itinerary from a list of airline tickets starting at JFK. Learn to apply Hierholzer's algorithm and depth-first search to find Eulerian paths using graph data structures.
We'll cover the following...
Statement
Given a list of airline tickets where tickets[i] = [fromi, toi] represent a departure airport and an arrival airport of a single flight, reconstruct the itinerary in the correct order and return it.
The person who owns these tickets always starts their journey from "JFK". Therefore, the itinerary must begin with "JFK". If there are multiple valid itineraries, you should prioritize the one with the smallest
For example, the itinerary
["JFK", "EDU"]has a smaller lexical order than["JFK", "EDX"].
Note: You may assume all tickets form at least one valid itinerary. You must use all the tickets exactly once.
Constraints:
tickets.lengthtickets[i].lengthfromi...