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

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1631. Path With Minimum Effort

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact