Problem: Rotting Oranges

med

30 min

Explore how to determine the minimum time required for all fresh oranges in a grid to become rotten by understanding the problem constraints and applying efficient algorithmic techniques. This lesson helps you practice problem-solving with grid traversal and breadth-first search, focusing on algorithm efficiency within set constraints.

Statement

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.

Problem: Rotting Oranges

med

30 min

Statement

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.

Problem: Rotting Oranges

Statement

Examples

Understand the problem

Try it yourself

Problem: Rotting Oranges

Statement

Examples

Understand the problem

Try it yourself