Reconstruct Itinerary (LeetCode 332)
HardLeetCode 332 · DFS · Google, Amazon +20 · 29:10Reconstruct Itinerary · Clean · Simple · Intuitive · GOOGLE · Leetcode-332 · Live CodeMy notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 332 Reconstruct Itinerary by codestorywithMIK: Graphs, Hard. Topics: Array, String, Depth-First Search, Graph Theory. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit, Eulerian Path, Semi-Eulerian Graph
- Patterns
- DFS
- Chapter
- Graphs
- Duration
- 29:10
Related problems
- Graph Concepts & Qns - 4 (Microsoft, Amazon, Flipkart) : Detect Cycle in Undirected Graph using DFS
- Number of Provinces - (Google, Microsoft ) (LeetCode 547)
- Course Schedule (LeetCode 207)
- Course Schedule-II (LeetCode 210)
- Is Graph Bipartite ? (LeetCode 785)
- Strongly Connected Components
- Hierholzer's Algorithm (LeetCode 2097)
- Diameter Of Undirected Graph (LeetCode 1245)