Minimum Cost to Make at Least One Valid Path in a Grid (LeetCode 1368)
HardLeetCode 1368 · BFS · Google, Amazon +4 · 55:41Minimum Cost to Make at Least One Valid Path in a Grid · 2 Detailed Approaches · Leetcode 1368My 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 1368 Minimum Cost to Make at Least One Valid Path in a Grid by codestorywithMIK: Graphs, Hard. Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue). Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path, 0-1 BFS, Dijkstra's Algorithm
- Patterns
- BFS, Shortest Path (Dijkstra/Bellman/Floyd)
- Chapter
- Graphs
- Duration
- 55:41