1102. Path With Maximum Minimum Value
ArrayBinary SearchDepth-First SearchBreadth-First SearchUnion-FindHeap (Priority Queue)MatrixDijkstra's Algorithm
Hints
Hint 1
What if we sort each cell of the matrix by the value?
Hint 2
Don't include small values in your path if you can only include large values.
Hint 3
Let's keep adding a possible cell to use in the path incrementally with decreasing values.
Hint 4
If the start and end cells are connected then we don't need to add more cells.
Hint 5
Use union-find data structure to check connectivity and return as answer the value of the given cell that makes start and end cells connected.
Preparing judge…