Leetcode Problem 994. Rotting Oranges

994. Rotting Oranges

Leetcode Solutions

Initialize a queue to keep track of rotten oranges and a counter for fresh oranges.
Iterate over the grid, enqueue the position of all rotten oranges and count fresh oranges.
If there are no fresh oranges, return 0 as no time is needed.
Use a delimiter to separate minutes in the queue.
While the queue is not empty, process oranges level by level (minute by minute).
For each rotten orange, rot its fresh neighbors and enqueue them.
After processing all oranges in a minute, increment the time.
After BFS, if there are still fresh oranges, return -1; otherwise, return the time.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen