Search results
Given a grid of dimension nxm where each cell in the grid 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 . We have to determine what is the earliest ti.
Apr 25, 2024 · 2: Cells have rotten oranges; The task is to the minimum time required so that all the oranges become rotten. A rotten orange at index (i,j ) can rot other fresh oranges which are its neighbors (up, down, left, and right). If it is impossible to rot every orange then simply return -1.
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.
May 27, 2024 · A rotten orange at index (i,j ) can rot other fresh oranges which are its neighbors (up, down, left, and right). If it is impossible to rot every orange then simply return -1. Examples: Output: 2. Input: arr[][C] = { {2, 1, 0, 2, 1}, {0, 0, 1, 2, 1}, {1, 0, 0, 2, 1}} Output: -1.
We would like to show you a description here but the site won’t allow us.
Aug 20, 2018 · 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.
Free resources that can never be matched, presented to all our Geeks for free! Subscribe now and start practicing today: / @geeksforgeekspractice \ Solve the Problem of the day and test...
