Leetcode 1293. Shortest Path in a Grid with Obstacles Elimination
Find the minimum number of steps from the top-left to bottom-right in a 4-directional binary grid if you may remove up to k obstacles; treat each position together with remaining eliminations as the state and perform a shortest-path search (BFS) over that expanded state space, returning the step count or -1 if unreachable.
Asked at:
Meta
Oracle
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late April, 2025
Oracle
Staff
Late March, 2025
Meta
Mid-level
Mid December, 2024
Meta
Mid-level
Find shortest path with obstacles in grid
Your account is free and you can post anonymously if you choose.