Path With Minimum Effort

In a grid of heights, the effort of a path is the maximum absolute height difference between two consecutive cells on it. Print the minimum effort needed to travel from the top-left to the bottom-right cell (moves are up, down, left, right).

1 <= R, C <= 100 1 <= height <= 10^6