Leetcode 1102. Path With Maximum Minimum Value

Given an integer grid where you can move 4-directionally from the top-left to the bottom-right, find a path that maximizes the minimum cell value along the path and return that maximized minimum; this is a maximin path problem typically solved with reachability checks (binary search + BFS/DFS) or a greedy max-heap/Dijkstra-style traversal.