Consider an $m \times n$ grid containing cells with three potential values:

• $0$, which indicates an unoccupied cell.

• $1$, representing a freshly picked orange.

• $2$, indicating a rotten orange.

Any fresh orange that is 4–directionally adjacent to a rotten orange will also turn rotten with each passing minute.

Your task is to determine the minimum time required for all cells to have rotten oranges. In case, this objective cannot be achieved, return $-1$.

Constraints:

• m $=$ grid.length

• n $=$ grid[i].length

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

• grid[i][j] is 0, 1, or 2.

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:

Implement your solution in the following coding playground: