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 | 力扣

• Tags: Array, Breadth First Search, Graph, Heap Priority Queue, Matrix, Shortest Path

2290. Minimum Obstacle Removal to Reach Corner

• LeetCode | 力扣

• Tags: Array, Breadth First Search, Graph, Heap Priority Queue, Matrix, Shortest Path

3286. Find a Safe Walk Through a Grid

• LeetCode | 力扣

• Tags: Array, Breadth First Search, Graph, Heap Priority Queue, Matrix, Shortest Path

1824. Minimum Sideway Jumps

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Greedy