Search results
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.
Rotten Oranges. Difficulty: Medium Accuracy: 46.02% Submissions: 139K+ Points: 4. 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.
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.
Dec 26, 2022 · 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. So the task is to determine what is the minimum time required so that all the oranges become rotten.
Nov 11, 2021 · The key observation is that fresh oranges adjacent to rotten oranges are rotten on day 1, those adjacent to those oranges are rotten on day 2, and so on. The phenomenon is similar to a level order traversal on a graph, where all the initial rotten oranges act as root nodes.
Mar 23, 2020 · 61K views 4 years ago INDIA. This video explains a very frequently asked programming interview question which is to find the time taken to rot all oranges in a basket of orange. This video...
Mar 27, 2024 · In the rotting oranges problem, we are given a matrix consisting of three numbers 0, 1, and 2. Here 0, 1, and 2 represent no orange, fresh orange, and rotten orange, respectively. A rotten orange can rot its adjacent fresh orange in a single time frame.
Sep 13, 2020 · Problem statement. You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values: Value 0 - representing an empty cell. Value 1 - representing a fresh orange. Value 2 - representing a rotten orange. Every second, any fresh orange that is adjacent (4-directionally) to a rotten orange becomes rotten.
Jul 24, 2021 · Rotting Oranges – Java Code & Explanation. In this problem, we have to find the time taken to rot all fresh oranges, if it’s not possible then return -1. How to approach this problem? i) To solve this problem, the first step is to find all the oranges that are initially rotten.
