How should I practice Minimum Obstacle Removals on a Shortest Grid Path?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon onsite interview problems in FastPrep.

Is Minimum Obstacle Removals on a Shortest Grid Path associated with Amazon?

FastPrep tags this as a Amazon onsite interview coding practice problem when the problem catalog has that company and stage context.

Minimum Obstacle Removals on a Shortest Grid Path

Amazon● MediumFULLTIMEONSITE INTERVIEW

Problem 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 that may be removed.

Start at the top-left cell and reach the bottom-right cell. You may move one cell up, down, left, or right.

First restrict attention to routes with the minimum possible number of steps. Among those shortest routes, return the minimum number of obstacle cells that must be removed.

The problem statement continues

Pro

Examples

Example 1

grid = [[0,1,0],[0,1,0],[0,0,0]]return = 0

The four-step route down, down, right, right enters no obstacle cells.

FastPrep Pro

Reported in 1 Amazon interview this week

Unlock 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

See Amazon hiring insights