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.