You are given a $2 {D}$ integer array moveTime of size $n \times m$, where moveTime[i][j] represents the minimum time in seconds that must elapse before you can start moving into room $(i, j)$.

You begin at room $(0, 0)$ at time $t = 0$. From any room, you can move to any adjacent room sharing an edge in the four cardinal directions (up, down, left, right). Each move between adjacent rooms takes exactly $1$ second. You can only start moving toward a room $(i, j)$ once the current time is greater than or equal to moveTime[i][j].

Return the minimum time in seconds required to reach the destination room $(n - 1, m - 1)$.

Constraints:

• $2 \leq n ==$ moveTime.length $\leq 50$

• $2 \leq m ==$ moveTime[i].length $\leq 50$

• $0 \leq$ moveTime[i][j] $\leq 10^9$

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.