Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Path With Maximum Minimum Value
Bookmark
Binary Search
Max-Heap
Union Find
Input
Example 1
Example 2
Simple 2x2
3x3 varied
Custom
grid
=
[[5,4,5],[1,2,6],[7,4,6]]
5
4
5
1
2
6
7
4
6
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
(0,1)
front / rear
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
(1,1)
front / rear
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
(1,2)
(2,1)
front
rear
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
(2,2)
front / rear
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
(0,2)
front / rear
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
queue
Eligible
Visited
Ineligible
5
4
5
1
2
6
7
4
6
queue
Eligible
Visited
Ineligible
algo
master
.
io
Step:
Start: Find path maximizing the minimum value along the path
0 / 82
Input
Example 1
Example 2
Simple 2x2
3x3 varied
Custom
grid
=
[[5,4,5],[1,2,6],[7,4,6]]
0 / 82
algo
master
.
io
Step:
Start: Find path maximizing the minimum value along the path
