Solution: Reconstruct Itinerary

Explore how to reconstruct an itinerary from airline tickets by applying Hierholzer’s algorithm for Eulerian paths and depth-first search. Learn to organize destinations in lexical order starting from JFK and understand the time and space complexity of the solution within graph theory context.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

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 sorting arrangement 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 exactly once.

Constraints:

$1 \leq$ tickets.length $\leq 300$
tickets[i].length $= 2$
from_i ...