Grid 01 BFS¶
Table of Contents¶
- 1368. Minimum Cost to Make at Least One Valid Path in a Grid (Hard)
- 2290. Minimum Obstacle Removal to Reach Corner (Hard)
- 3286. Find a Safe Walk Through a Grid (Medium)
- 1824. Minimum Sideway Jumps (Medium)
1368. Minimum Cost to Make at Least One Valid Path in a Grid¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, breadth first search, graph, heap priority queue, matrix, shortest path
2290. Minimum Obstacle Removal to Reach Corner¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, breadth first search, graph, heap priority queue, matrix, shortest path
3286. Find a Safe Walk Through a Grid¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, breadth first search, graph, heap priority queue, matrix, shortest path
1824. Minimum Sideway Jumps¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, greedy