Update Rotting Oranges - Leetcode 994.py

Author: gahogg

Rotting Oranges - Leetcode 994/Rotting Oranges - Leetcode 994.py

@@ -1,3 +1,43 @@
+# Code for Bootcamp
+class Solution:
+    from collections import deque
+    
+    def orangesRotting(self, grid):
+        # Initialize variables
+        Minute = 0
+        Q = deque()
+        FreshCount = 0
+        M, N = len(grid), len(grid[0])
+        
+        # Populate queue with initial rotten oranges and count fresh oranges
+        for i in range(M):
+            for j in range(N):
+                if grid[i][j] == 2:
+                    Q.append((i, j))
+                elif grid[i][j] == 1:
+                    FreshCount += 1
+
+        # Directions for adjacent cells (right, down, left, up)
+        Directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]
+
+        # Perform BFS
+        while Q and FreshCount > 0:
+            NumRotting = len(Q)
+            for _ in range(NumRotting):
+                i, j = Q.popleft()
+                for r, c in [(i, j + 1), (i + 1, j), (i, j - 1), (i - 1, j)]:
+                    if 0 <= r < M and 0 <= c < N and grid[r][c] == 1:
+                        grid[r][c] = 2
+                        FreshCount -= 1
+                        Q.append((r, c))
+            Minute += 1  # Increment minute after processing all rotten oranges in this round
+        
+        # Return the time taken or -1 if fresh oranges remain
+        return Minute if FreshCount == 0 else -1
+
+
+
+# Code for YouTube Video
 from collections import deque
 class Solution:
     def orangesRotting(self, grid: List[List[int]]) -> int: