Search⌘ K
AI Features

DIY: Rotting Oranges

Understand how to solve the Rotting Oranges problem by analyzing grid-based network conditions. Learn to calculate the minimum minutes for fresh oranges to rot while handling edge cases where some oranges cannot rot. This lesson enhances problem decomposition and algorithm design skills for coding interviews.

Problem Statement

You are given an m * n grid. Each cell in the grid contains one of the three values: [0, 1, 2]. Each value represents the following:

  • 0 represents an empty cell.
  • 1 represents a fresh orange.
  • 2 represents a rotten orange.

A fresh orange, represented by a 1 in the grid, will be rotten if it is four dir ...