Rotting Oranges

[iamakashrout]

Description

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

0 representing an empty cell, 1 representing a fresh orange, or 2 representing a rotten orange. 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.

DSA Problem

Rotting Oranges (Leetcode Problem 994)

[iamakashrout]

@iamdestinychild I want to add the solution for this question, please assign it to me.

[Ridhikalra]

please assign this issue to me. I will try to give optimized solution for this. @iamdestinychild

[kunjshukla]

Hey there, can you please assign me this issue.