#1498Medium#13 in Goldman Sachs's list· asked at 9 companies
Path with minimum effort
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: heights = [[1,2,2],[3,8,2],[5,3,5]] Output: 2
The route 1,3,5,3,5 has maximum difference 2.
Example 2
Input: heights = [[1,2,3],[3,8,4],[5,3,5]] Output: 1
Example 3
Input: heights = [[1,2,1,1,1],[1,2,1,2,1],[1,2,1,2,1],[1,2,1,2,1],[1,1,1,2,1]] Output: 0
Constraints
- •
rows == heights.length - •
columns == heights[i].length - •
1 <= rows, columns <= 100 - •
1 <= heights[i][j] <= 10^6