Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Path With Minimum Effort
Bookmark
Input
Example 1 (ans: 2)
Example 2 (ans: 1)
Example 3 (ans: 0)
Custom
heights
=
[[1,2,2],[3,8,2],[5,3,5]]
1
e:0
S
2
e:inf
2
e:inf
3
e:inf
8
e:inf
2
e:inf
5
e:inf
3
e:inf
5
e:inf
D
min-heap (effort, row, col)
Default
Active
Visited
Checking
1
e:0
S
2
e:inf
2
e:inf
3
e:inf
8
e:inf
2
e:inf
5
e:inf
3
e:inf
5
e:inf
D
min-heap (effort, row, col)
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:inf
3
e:2
8
e:inf
2
e:inf
5
e:inf
3
e:inf
5
e:inf
D
min-heap (effort, row, col)
(1,0,1)
(2,1,0)
front
rear
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:1
3
e:2
8
e:inf
2
e:inf
5
e:inf
3
e:inf
5
e:inf
D
min-heap (effort, row, col)
(1,0,2)
(2,1,0)
front
rear
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:1
3
e:2
8
e:6
2
e:inf
5
e:inf
3
e:inf
5
e:inf
D
min-heap (effort, row, col)
(2,1,0)
(6,1,1)
front
rear
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:1
3
e:2
8
e:6
2
e:1
5
e:inf
3
e:inf
5
e:inf
D
min-heap (effort, row, col)
(2,1,0)
(6,1,1)
front
rear
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:1
3
e:2
8
e:6
2
e:1
5
e:inf
3
e:inf
5
e:3
D
min-heap (effort, row, col)
(3,2,2)
(6,1,1)
front
rear
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:1
3
e:2
8
e:5
2
e:1
5
e:2
3
e:inf
5
e:3
D
min-heap (effort, row, col)
(2,2,0)
(3,2,2)
(5,1,1)
(6,1,1)
front
rear
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:1
3
e:2
8
e:5
2
e:1
5
e:2
3
e:2
5
e:3
D
min-heap (effort, row, col)
(2,2,1)
(3,2,2)
(5,1,1)
(6,1,1)
front
rear
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:1
3
e:2
8
e:5
2
e:1
5
e:2
3
e:2
5
e:3
D
min-heap (effort, row, col)
(3,2,2)
(5,1,1)
(6,1,1)
front
rear
Default
Active
Visited
Checking
1
e:0
S
2
e:1
2
e:1
3
e:2
8
e:5
2
e:1
5
e:2
3
e:2
5
e:2
D
min-heap (effort, row, col)
(3,2,2)
(5,1,1)
(6,1,1)
front
rear
Default
Active
Visited
Checking
algo
master
.
io
Step:
Start: Initialize effort grid. effort[0][0] = 0, all others = infinity. Push (0, 0, 0) into min-heap.
0 / 59
Input
Example 1 (ans: 2)
Example 2 (ans: 1)
Example 3 (ans: 0)
Custom
heights
=
[[1,2,2],[3,8,2],[5,3,5]]
0 / 59
algo
master
.
io
Step:
Start: Initialize effort grid. effort[0][0] = 0, all others = infinity. Push (0, 0, 0) into min-heap.
