Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Shortest Path in a Grid with Obstacles Elimination
Bookmark
Input
Example 1
Example 2
Small easy
Manhattan shortcut
Custom
grid
=
[[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]]
,
k
=
1
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
(1,0,k=0)
(0,2,k=1)
(1,1,k=0)
front
rear
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
(1,1,k=0)
(2,0,k=0)
(0,0,k=0)
(1,2,k=1)
front
rear
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
(1,2,k=1)
(1,2,k=0)
(2,1,k=0)
(0,1,k=0)
(3,0,k=0)
front
rear
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
(2,1,k=0)
(0,1,k=0)
(3,0,k=0)
(2,2,k=1)
(2,2,k=0)
front
rear
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
(2,2,k=1)
(2,2,k=0)
(0,2,k=0)
front
rear
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
(0,2,k=0)
(4,0,k=0)
(2,1,k=1)
(3,2,k=0)
front
rear
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
(3,2,k=0)
(4,1,k=0)
front
rear
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
(2,0,k=1)
(3,1,k=0)
(4,2,k=0)
front
rear
queue
Open
Obstacle
Visited
Eliminated
0
0
0
1
1
0
0
0
0
0
1
1
0
0
0
queue
Open
Obstacle
Visited
Eliminated
algo
master
.
io
Step:
Start: Find shortest path from (0,0) to (4,2) with at most 1 obstacle eliminations
0 / 132
Input
Example 1
Example 2
Small easy
Manhattan shortcut
Custom
grid
=
[[0,0,0],[1,1,0],[0,0,0],[0,1,1],[0,0,0]]
,
k
=
1
0 / 132
algo
master
.
io
Step:
Start: Find shortest path from (0,0) to (4,2) with at most 1 obstacle eliminations
