Breadth-First Search/Rotting OrangesMedium

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Rotting Oranges

Breadth-First Search·Medium

You are given an m x n grid where each cell can have one of three values:

Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.

Return the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return -1.

If there are no fresh oranges to begin with, return 0.

Examples

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

Output: 4

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

Output: -1

The orange in the bottom-left corner (row 2, column 0) is never rotten because it is never 4-directionally adjacent to a rotten one.

Input: grid = [[0,2]]

Output: 0

There are no fresh oranges, so the answer is 0.

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Complete approach — pattern and complexity both named.

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

No divergence detected. The code correctly aligns with the stated approach.

Try solving related sliding window problems to build familiarity with two-pointer variants.

No signals fired — clean run, you stayed in flow.