Yahoo India Web Search

Sign In

Search results

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

    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.

    • Submissions

      Submissions - Rotting Oranges - LeetCode

    • Solution

      Can you solve this real interview question? - Level up your...

  2. www.geeksforgeeks.org › minimum-time-required-soMinimum time required to rotten all oranges - GeeksforGeeks

    Apr 25, 2024 · Minimum time required to rotten all oranges. Examples: Input: arr [] [C] = { {2, 1, 0, 2, 1}, {1, 0, 1, 2, 1}, {1, 0, 0, 2, 1}}; Output: 2. Explanation: At 0th time frame: {2, 1, 0, 2, 1} {1, 0, 1, 2, 1} {1, 0, 0, 2, 1} At 1st time frame: {2, 2, 0, 2, 2} {2, 0, 2, 2, 2} {1, 0, 0, 2, 2} At 2nd time frame: {2, 2, 0, 2, 2} {2, 0, 2, 2, 2}

    • 17 min

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

    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.

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

    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.

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

    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.

  6. 4wangyu.github.io › leetcode › docsRotting Oranges · LeetCode

    Description. In a given grid, each cell can have one of three values: the value 0 representing an empty cell; the value 1 representing a fresh orange; the value 2 representing a rotten orange. Every minute, any fresh orange that is adjacent (4-directionally) to a rotten orange becomes rotten.

  7. algo.monster › liteproblems › rotting-orangesRotting Oranges - In-Depth Explanation

    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.