solulubeta
Sign in
NeetCode 150 / Graphs
11.06 · Problem

Rotting Oranges

Medium Multi-source BFS 1 video LC 994 Pro

This problem is part of solulu Pro

In a grid, 0 is empty, 1 is a fresh orange and 2 a rotten one. Every minute, each fresh orange next to (4-directionally) a rotten one becomes rotten. Return the minimum minutes until no fresh orange is left, or -1 if…

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 85 of 150 · updated 2026-10-12