akshit0699

from collections import deque

# Time complexity: O(rows * cols) -> each cell is visited at least once
# Space complexity: O(rows * cols) -> in the worst case if all the oranges are rotten they will be added to the queue

class Solution:
    def orangesRotting(self, grid):
        
        # number of rows
        rows = len(grid)

akshit0699

def maxDistance(self, grid):

        rows = len(grid)
        if rows == 0:
            return -1
        
        cols = len(grid[0])
        lands = collections.deque()
        
        maxDistance = 0