Yahoo India Web Search

Search results

1. www.geeksforgeeks.org › problems › rotten-oranges2536Rotten Oranges | Practice | GeeksforGeeks

   www.geeksforgeeks.org › problems › rotten-oranges2536

   • Cached

   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.

   • Minimum Time to Rot All

     Given a matrix of dimension M * N, where each cell in the...

   • Rotten Oranges using JavaScript

     The idea is to use Breadth First Search. The condition of...

2. www.geeksforgeeks.org › minimum-time-required-soRotten Oranges - Minimum Time to Rot All - GeeksforGeeks

   www.geeksforgeeks.org › minimum-time-required-so

   • Cached

   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.

   • Video Duration: 17 min

3. leetcode.com › problems › rotting-orangesRotting Oranges - LeetCode

   leetcode.com › problems › rotting-oranges

   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.

4. www.geeksforgeeks.org › rotten-oranges-usingRotten Oranges using JavaScript - GeeksforGeeks

   www.geeksforgeeks.org › rotten-oranges-using

   • Cached

   May 27, 2024 · The idea is to use Breadth First Search. The condition of oranges getting rotten is when they come in contact with other rotten oranges. This is similar to a breadth-first search where the graph is divided into layers or circles and the search is done from lower or closer layers to deeper or higher layers.

5. leetcode.ca › 2018/08/20-994-Rotting-Oranges994 - Rotting Oranges - Leetcode

   leetcode.ca › 2018/08/20-994-Rotting-Oranges

   • Cached

   Aug 20, 2018 · A problem of finding the minimum number of minutes to rot all oranges in a grid. See the description, examples, and solutions in Java, C++, Python, Go, and TypeScript.

6. www.youtube.com › watchG-10. Rotten Oranges | C++ | Java - YouTube

   www.youtube.com › watch

   • Cached

   Learn how to solve the dynamic programming problem of rotten oranges on GeeksforGeeks using C++ and Java. Watch the video, get the link to the problem, the codes and notes, and other resources from takeUforward.

   • Video Duration: 23 min
   • Views: 316.7K

   • Author: take U forward

7. People also ask

   How do you find Rotten oranges?

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

   Rotting Oranges - LeetCode

   leetcode.com/problems/rotting-oranges/

   See all results for this question

   Can a rotten orange rot other fresh oranges?

   • 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 The 1 at the bottom left corner of the matrix is never rotten.

   Rotten Oranges using JavaScript - GeeksforGeeks

   www.geeksforgeeks.org/rotten-oranges-using-javascript/

   See all results for this question

   What is a rotten orange matrix?

   • 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: 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).

   Rotten Oranges - Minimum Time to Rot All - GeeksforGeeks

   www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten/

   See all results for this question

   How do you know if an orange is Rotten?

   • 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. Example 1: Output: 4 Example 2: Output: -1

   Rotting Oranges - LeetCode

   leetcode.com/problems/rotting-oranges/

   See all results for this question

8. leetcodethehardway.com › rotting-oranges-medium0994 - Rotting Oranges (Medium) | LeetCode The Hard Way

   leetcodethehardway.com › rotting-oranges-medium

   • Cached

   A solution to the LeetCode problem 0994, where you have to find the minimum number of minutes to rot all oranges in a grid. The solution uses BFS and a queue to check the adjacent oranges and update the grid.