← Back to problem library
Problem detail
332. Reconstruct Itinerary
HardArrayStringDepth-First SearchGraph TheorySortingHeap (Priority Queue)Eulerian CircuitEulerian PathSemi-Eulerian Graph
Use this page to open the original problem, record a review, and keep the reasoning you want to remember for the next attempt.
Review history
No review history yet. Record your first attempt after solving this problem.