Search⌘ K
AI Features
Home
Courses
Decode the Coding Interview in Ruby: Real-World Examples

DIY: Rotting Oranges

Understand how to solve the rotting oranges problem by implementing an algorithm that calculates the minimum minutes until no fresh oranges remain. Learn to work with grid data structures and apply network-based logic for efficient solutions.

We'll cover the following...

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 ...