Shortest Grid Path With One Wall Break
Amazon● MediumINTERNPHONE SCREENProblem statement
Given a rectangular binary matrix grid, a cell containing 1 is open and a cell containing 0 is a wall.
Start at the top-left cell and move to the bottom-right cell. Each move goes one cell up, down, left, or right. During the route, you may break and enter at most one wall.
The problem statement continues
ProExamples
Example 1
grid = [[1,0,1],[0,0,1],[1,1,1]]return = 4Break the wall at (0,1), then move through (0,2) and (1,2) to reach (2,2) in four moves.
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