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

DIY: Rotting Oranges

Understand how to solve the Rotting Oranges problem by implementing a function that calculates the minimum time for all fresh oranges to rot. Explore grid traversal and adjacency techniques critical for algorithmic interview questions.

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