Rotten Oranges Spread
You are given an m x n grid where each cell can have one of three values:
0representing an empty cell1representing a fresh orange2representing a rotten orange
Every minute, any fresh orange that is adjacent (4-directionally) to a rotten orange becomes rotten. Return the minimum number of minutes that must elapse until no fresh oranges remain, or return -1 if it's impossible.
Examples
Input: [[2,1,1],[1,1,0],[0,1,1]]
Output: 4
Input: [[2,1,1],[0,1,1],[1,0,1]]
Output: -1
Hints
Use BFS (Breadth-First Search) to simulate the spread
Add all initially rotten oranges to the queue
Process level by level to count minutes
Related Problems
Rotten Oranges Spread
You are given an `m x n` grid where each cell can have one of three values: