feat(leetcode): solve 1036 - Rotting Oranges

Author: arnav-on-code

README.md

@@ -9,37 +9,37 @@ Automatically synchronize accepted LeetCode submissions to GitHub.
 ```text
 ████████████░░░░░░░░░░░░░░░░░░
 
-Solved: 125 / 300 Problems
+Solved: 126 / 300 Problems
 
 📊 Statistics
 Difficulty	Solved
 🟢 Easy	63
-🟡 Medium	56
+🟡 Medium	57
 🔴 Hard	6
-Total	125
+Total	126
 🔥 Latest Accepted Problem
 
 
 | Field | Value |
 |------|------|
-| Problem ID | 1127 |
-| Title | Last Stone Weight |
+| Problem ID | 1036 |
+| Title | Rotting Oranges |
 | Language | Python3 |
-| Runtime | 3 ms |
-| Memory | 19.4 MB |
+| Runtime | 4 ms |
+| Memory | 19.5 MB |
 
 
 💻 Languages Used
 
-- **Python3** : 60
+- **Python3** : 61
 
 ## 📚 Recent Accepted Problems
 
+- 1036 Rotting Oranges
 - 1127 Last Stone Weight
 - 1014 K Closest Points To Origin
 - 295 Find Median From Data Stream
 - 11 Container With Most Water
-- 200 Number Of Islands
 
 
 ---
@@ -81,4 +81,4 @@ Git
 GitHub
 ⏰ Last Sync
 
-2026-07-07 14:32:47
+2026-07-07 19:54:26

storage/solutions/1036_Rotting_Oranges/metadata.json

@@ -0,0 +1,11 @@
+{
+    "submission_id": "2059487580",
+    "question_id": "1036",
+    "title_slug": "rotting-oranges",
+    "language": "python3",
+    "language_verbose": "Python3",
+    "runtime": "4 ms",
+    "memory": "19.5 MB",
+    "status_code": 10,
+    "timestamp": 1783439208
+}

storage/solutions/1036_Rotting_Oranges/solution.py

@@ -0,0 +1,58 @@
+class Solution:
+    def orangesRotting(self, grid: List[List[int]]) -> int:
+        from collections import deque
+
+        rows = len(grid)
+        cols = len(grid[0])
+
+        queue = deque()
+
+        fresh = 0
+
+        for r in range(rows):
+            for c in range(cols):
+
+                if grid[r][c] == 2:
+                    queue.append((r, c))
+
+                elif grid[r][c] == 1:
+                    fresh += 1
+
+        minutes = 0
+
+        directions = [
+            (1,0),
+            (-1,0),
+            (0,1),
+            (0,-1)
+        ]
+
+        while queue and fresh > 0:
+
+            for _ in range(len(queue)):
+
+                r, c = queue.popleft()
+
+                for dr, dc in directions:
+
+                    nr = r + dr
+                    nc = c + dc
+
+                    if (
+                        nr < 0 or
+                        nc < 0 or
+                        nr >= rows or
+                        nc >= cols or
+                        grid[nr][nc] != 1
+                    ):
+                        continue
+
+                    grid[nr][nc] = 2
+
+                    fresh -= 1
+
+                    queue.append((nr, nc))
+
+            minutes += 1
+
+        return minutes if fresh == 0 else -1

storage/stats.json

@@ -1,12 +1,16 @@
 {
-    "total": 125,
+    "total": 126,
     "easy": 63,
-    "medium": 56,
+    "medium": 57,
     "hard": 6,
     "languages": {
-        "Python3": 60
+        "Python3": 61
     },
     "recent_problems": [
+        {
+            "id": "1036",
+            "title": "Rotting Oranges"
+        },
         {
             "id": "1127",
             "title": "Last Stone Weight"
@@ -22,18 +26,14 @@
         {
             "id": "11",
             "title": "Container With Most Water"
-        },
-        {
-            "id": "200",
-            "title": "Number Of Islands"
         }
     ],
     "last_problem": {
-        "id": "1127",
-        "title": "Last Stone Weight",
+        "id": "1036",
+        "title": "Rotting Oranges",
         "language": "Python3",
-        "runtime": "3 ms",
-        "memory": "19.4 MB"
+        "runtime": "4 ms",
+        "memory": "19.5 MB"
     },
-    "last_sync": "2026-07-07 14:32:47"
+    "last_sync": "2026-07-07 19:54:26"
 }