#1720Hard#34 in D. E. Shaw's list· asked at 7 companies
Shortest Path in a Grid with Obstacles Elimination
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: grid = [[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]], k = 1 Output: 6
Eliminate the obstacle at (3,2) and walk (0,0) -> (0,1) -> (0,2) -> (1,2) -> (2,2) -> (3,2) -> (4,2).
Example 2
Input: grid = [[0,1,1],[1,1,1],[1,0,0]], k = 1 Output: -1
Constraints
- •
m == grid.length - •
n == grid[i].length - •
1 <= m, n <= 40 - •
1 <= k <= m * n - •
grid[0][0] == grid[m - 1][n - 1] == 0