Path With Minimum Effort GFG POTD Python Solution geeks for geeks problem of the day
Problem - https://www.geeksforgeeks.org/problem...
You are a hiker preparing for an upcoming hike. You are given heights[][], a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and you hope to travel to the bottom-right cell, (rows-1, columns-1) (i.e., 0-indexed). You can move up, down, left, or right, and you wish to find the route with minimum effort.
Note: A route's effort is the maximum absolute difference in heights between two consecutive cells of the route.
Example 1:
Input:
row = 3
columns = 3
heights = [[1,2,2],[3,8,2],[5,3,5]]
Output:
2
Explaination:
The route 1-3-5-3-5 has a maximum absolute difference of 2 in consecutive cells. This is better than the route 1-2-2-2-5, where the maximum absolute difference is 3.
Example 2:
Input:
row = 2
columns = 2
heights = [[7,7],[7,7]]
Output:
0
Explaination:
Any route from the top-left cell to the bottom-right cell has a maximum absolute difference of 0 in consecutive cells