Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Average Salary Excluding the Minimum and Maximum Salary
Coding
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Difference Between Maximum and Minimum Price Sum
Coding
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Google
Leetcode 1102. Path With Maximum Minimum Value
Reported May 26, 2026 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View source