Minimum Obstacle Removal to Reach Corner
Shortest path where entering an empty cell costs 0 and an obstacle costs 1, solved with a 0-1 BFS deque.
Shortest path where entering an empty cell costs 0 and an obstacle costs 1, solved with a 0-1 BFS deque.