You are given a rectangular grid rooms of size m by n where each cell represents one of the following:
a wall with value $-1$
a gate with value $0$
an empty room with value $2^{31} - 1$

Update rooms in place so that each empty room contains the distance to its nearest gate, measured as the minimum number of moves between adjacent cells sharing a side. If an empty room cannot reach any gate, its value must remain $2^{31} - 1$. Walls and gates must remain unchanged.

Note: Modify rooms in place and do not return anything.

Constraints:

• m == rooms.length

• n == rooms[i].length

• $1 \leq$ m, n $\leq 250$

• rooms[i][j] is $-1$, $0$, or $2^{31} - 1$

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.