Leetcode 1631. Path With Minimum Effort

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).