Given an $n \times n$ grid (2D matrix) where each cell grid[i][j] represents the elevation at position (i, j).

Once it starts to rain, the water level rises over time. At any given time t, the water depth across the grid equals t. A swimmer can move from one cell to an adjacent cell (up, down, left, or right) if both cells have elevations less than or equal to the current water level t.

If the elevation condition is satisfied, a swimmer can swim any distance instantly. However, he cannot move outside the grid boundaries.

Return the minimum time t at which it becomes possible to swim from the top-left cell $(0, 0)$ to the bottom-right cell $(n - 1, n - 1)$.

Constraints:

• $n ==$ grid.length

• $n ==$ grid[i].length

• $1 \leq$ $n$ $\leq 30$

• $0 \leq$ grid[i][j] $< n^2$

• Each value grid[i][j] is unique.

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.