Freedom Trail (LeetCode 514)
HardLeetCode 514 · Shortest Path (Dijkstra/Bellman/Floyd) · Google, PhonePe · 40:18Freedom Trail · Using Shortest Path in Graph · Modified Dijkstra · Leetcode 514My 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 514 Freedom Trail by codestorywithMIK: Graphs, Hard. Topics: String, Dynamic Programming, Depth-First Search, Breadth-First Search. Watch the explanation, then check the code and solve it on LeetCode.
- Problem
- LeetCode 514: Freedom Trail
- Difficulty
- hard
- Topics
- String, Dynamic Programming, Depth-First Search, Breadth-First Search
- Patterns
- Shortest Path (Dijkstra/Bellman/Floyd)
- Chapter
- Graphs
- Duration
- 40:18