Practice Reconstruct Itinerary

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#332

LeetCode Problem

Reconstruct Itinerary

Depth-First Search Graph Eulerian Circuit

Problem Statement

You are given a list of airline tickets where tickets[i] = [fromi, toi] represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it. All of the tickets belong to a man who departs from "JFK", thus, the itinerary must begin with "JFK". If there are multiple valid itineraries, you should return the itinerary that has the smallest lexical order when read as a single string. You may assume all tickets form at least one valid itinerary. You must use all the tickets once and only once.

Source: Reconstruct Itinerary on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

tickets = [["MUC","LHR"],["JFK","MUC"],["SFO","SJC"],["LHR","SFO"]]

Output

["JFK","MUC","LHR","SFO","SJC"]

# Example 2

Input

tickets = [["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO"]]

Output

["JFK","ATL","JFK","SFO","ATL","SFO"]

Constraints

1 <= tickets.length <= 300

tickets[i].length == 2

fromi.length == 3

toi.length == 3

fromi and toi consist of uppercase English letters.

fromi != toi

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free