You are given a $2$D array heights of size rows $ imes$ columns, where heights[row][col] represents the height of the cell at coordinate (row, col).

You are currently positioned at the top left cell $(0, 0)$ and wish to travel to the bottom right cell $( ext{rows} - 1, ext{columns} - 1)$. You can move up, down, left, or right to adjacent cells.

A route’s effort is defined as the maximum absolute difference in heights between two consecutive cells along the path.

Return the minimum effort required to travel from the top left cell to the bottom right cell.

Constraints:

• rows $==$ heights.length

• columns $==$ heights[i].length

• $1 \leq$ rows, columns $\leq 100$

• $1 \leq$ heights[i][j] $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.