Coding - Rotting Oranges

Problem Statement

In a given grid representing a field of oranges, each cell can be one of three states:

• 0: Empty cell
• 1: Fresh orange
• 2: Rotten orange

Every minute, any fresh orange that is adjacent (up, down, left, right) to a rotten orange will also become rotten.

Return the minimum number of minutes required to rot all the fresh oranges. If it's impossible, return -1 instead.

Examples

Example 1:

Input: grid = [[2,1,1],[1,1,0],[0,1,1]] Output: 4

Example 2:

Input: grid = [[2,1,1],[0,1,1],[1,0,1]] Output: -1

Example 3:

Input: grid = [[0,2],[1,1]] Output: 0

Constraints

• m == grid.length
• n == grid[i].length
• 1 <= m, n <= 10^4
• grid[i][j] will be 0, 1, or 2.

Hints

1. Try using breadth-first search (BFS) to simulate the spread of rotten oranges.
2. Keep track of the time it takes for fresh oranges to become rotten.
3. If you encounter a fresh orange that cannot become rotten, return -1.

NOT_FOUND