Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 246

Reconstruct Itinerary

HardAdvanced Graphs

tickets[i] = [from, to]. Reconstruct the itinerary starting at JFK that uses every ticket once. If several exist, pick the lexicographically smallest destination whenever you have a choice.

Examples

Example 1

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

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

Constraints

1 ≤ tickets.length ≤ 300

Target ComplexityNot required

O(V + E) Time · O(V) Space

Companies (3)

AmazonGoogleUber

Node 22.08.0

Loading editor…

Test casesRun to compare output

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

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

Output—