Minimum Obstacle Removal to Reach Corner (LeetCode 2290)
HardLeetCode 2290 · BFS · Google, Amazon · 25:58Minimum Obstacle Removal to Reach Corner I · Using Studied Concept · Leetcode 2290My 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 2290 Minimum Obstacle Removal to Reach Corner 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
- 25:58