Solution: Shortest Path in a Grid with Obstacles Elimination
Solution: Shortest Path in a Grid with Obstacles Elimination asks for the fewest steps from the top-left to bottom-right, removing at most k obstacles along the way, or -1 if no path exists.
We'll cover the following...
We'll cover the following...
Statement
Given an m x n integer matrix grid, where each cell contains either
Return the minimum number of steps required to travel from the upper-left corner 0, 0