Search results
Rotting Oranges - 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.
Sep 17, 2024 · Given a matrix of dimension M * N, where each cell in the matrix can have values 0, 1 or 2 which has the following meaning: 0: Empty cell. 1: Cells have fresh oranges. 2: Cells have rotten oranges. The task is to the minimum time required so that all the oranges become rotten.
Can you solve this real interview question? Rotting Oranges - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
Aug 20, 2018 · 994. Rotting Oranges 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.
Leetcode Link. 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.
Aug 9, 2020 · Every minute, any fresh orange that is adjacent (4-directionally) 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 instead. You can see the examples and more information on the leetcode problem page.
Topics: graphs. In a given a 2 dimensional array of size mxn called grid, each cell can contain only three numbers 0, 1 and 2 . If the cell contains 0 , it means that the cell is empty. If the cell contains 1 , it means that the cell is filled with a fresh orange .
