Reconstruct Itinerary

Explore how to reconstruct a travel itinerary from given flight tickets by applying graph concepts and lexical order sorting. Learn to handle all tickets exactly once, starting from JFK, while prioritizing the smallest lexical route. This lesson helps you understand graph traversal in coding interviews through problem-solving and coding exercises.

We'll cover the following...

Statement
Example
Understand the problem
Figure it out!
Try it yourself

Statement

Given a list of airline tickets where tickets[i] = [from_i, to_i] 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 lexical ordeLexicographical order is a way of sorting similar to how words are arranged in a dictionary. It compares items character by character, based on their order in the alphabet or numerical value.r when considering a single string.

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 ...