LeetCode 1631 Path with Minimum Effort - Minimax Path

In standard Dijkstra, you minimize the sum of edge weights. Here, you minimize the maximum edge weight encountered on the path. When you move from cell A to cell B, the effort is abs(height[A] - height[B]). The total effort of a path is the largest single effort among all steps.

Example: Path A has steps [$1$, $5$, $2$]. Maximum is $5$. Path B has steps [$3$, $3$, $3$]. Maximum is $3$. Path B wins, even though both have the same sum.