Shortest Grid Path with Obstacle Eliminations
Amazon● HardFULLTIMEONSITE INTERVIEWProblem statement
You are given an m x n binary grid. A value of 0 is an open cell, and a value of 1 is an obstacle.
Start at the top-left cell (0, 0). In one step, you may move one cell up, down, left, or right while remaining inside the grid. You may eliminate at most k obstacles by entering their cells.
The problem statement continues
ProExamples
Example 1
grid = [[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]]k = 1return = 6A shortest route uses six steps and eliminates one obstacle.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week