Search⌘ K
Home
Courses
Decode the Coding Interview in Python: Real-World Examples

Reconstruct Itinerary

Explore solving the Reconstruct Itinerary problem by modeling airline tickets as a graph and applying depth-first search. Learn to efficiently produce the lexical order itinerary starting from a fixed airport, and understand the algorithm's time and space complexity.

We'll cover the following...

Description

Assume we have an array of airline tickets represented as pairs of departure and arrival airports like [from, to]. We have to reconstruct the itinerary in order. All tickets belong to a man who departs from a specified location, e.g., JFK. Therefore, the itinerary must begin with JFK. There might be multiple valid itineraries; you must return the itinerary with the smallest lexical order.

Constraints

Consider the following constraints:

  • 1 <= tickets.length <= 300
  • tickets[i].length must be 2.
  • fromi.lengthfrom_i.length, toi.lengthto_i.length == 3
  • fromifrom_i
...