Path With Minimum Effort (LeetCode 1631)
MediumLeetCode 1631 · Shortest Path (Dijkstra/Bellman/Floyd) · Google, Amazon +7 · 33:49Path With Minimum Effort · Leetcode-1631 · Dijkstra in 2-D Matrix · GOOGLE · Graph Concepts & Qns - 30My 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 1631 Path With Minimum Effort by codestorywithMIK: Graphs, Medium. Topics: Array, Binary Search, Depth-First Search, Breadth-First Search. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Dijkstra's Algorithm
- Patterns
- Shortest Path (Dijkstra/Bellman/Floyd)
- Chapter
- Graphs
- Duration
- 33:49