Second Minimum Time to Reach Destination (LeetCode 2045)
HardLeetCode 2045 · BFS · Google, Amazon · 1:05:58Second Minimum Time to Reach Destination · 2 Approaches · FULL DRY RUN · Leetcode 2045My 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 2045 Second Minimum Time to Reach Destination by codestorywithMIK: Graphs, Hard. Topics: Breadth-First Search, Graph Theory, Shortest Path, Dijkstra's Algorithm. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Breadth-First Search, Graph Theory, Shortest Path, Dijkstra's Algorithm, K Shortest Path
- Patterns
- BFS, Shortest Path (Dijkstra/Bellman/Floyd)
- Chapter
- Graphs
- Duration
- 1:05:58