Available question text
Find a path from the top-left to bottom-right of a 4-directional height grid that minimizes the route's effort, defined as the maximum absolute difference between consecutive cells — i.e., compute the minimax path in a weighted grid (solvable via Dijkstra on edge costs, binary search + BFS, or MST/Kruskal).
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 1631. Path With Minimum Effort
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source