feat(leetcode): solve 695 - Max Area Of Island

Author: arnav-on-code

README.md

@@ -9,37 +9,37 @@ Automatically synchronize accepted LeetCode submissions to GitHub.
 ```text
 ████████████░░░░░░░░░░░░░░░░░░
 
-Solved: 122 / 300 Problems
+Solved: 123 / 300 Problems
 
 📊 Statistics
 Difficulty	Solved
 🟢 Easy	63
-🟡 Medium	53
+🟡 Medium	54
 🔴 Hard	6
-Total	122
+Total	123
 🔥 Latest Accepted Problem
 
 
 | Field | Value |
 |------|------|
-| Problem ID | 200 |
-| Title | Number Of Islands |
+| Problem ID | 695 |
+| Title | Max Area Of Island |
 | Language | Python3 |
-| Runtime | 252 ms |
-| Memory | 21.6 MB |
+| Runtime | 22 ms |
+| Memory | 20.7 MB |
 
 
 💻 Languages Used
 
-- **Python3** : 6
+- **Python3** : 7
 
 ## 📚 Recent Accepted Problems
 
+- 695 Max Area Of Island
 - 200 Number Of Islands
 - 133 Clone Graph
 - 1 Two Sum
 - 295 Find Median From Data Stream
-- 1 Two Sum
 
 
 ---
@@ -81,4 +81,4 @@ Git
 GitHub
 ⏰ Last Sync
 
-2026-07-03 14:03:07
+2026-07-04 19:12:15

storage/solutions/0695_Max_Area_Of_Island/metadata.json

@@ -0,0 +1,11 @@
+{
+    "submission_id": "2055926600",
+    "question_id": "695",
+    "title_slug": "max-area-of-island",
+    "language": "python3",
+    "language_verbose": "Python3",
+    "runtime": "22 ms",
+    "memory": "20.7 MB",
+    "status_code": 10,
+    "timestamp": 1783178540
+}

storage/solutions/0695_Max_Area_Of_Island/solution.py

@@ -0,0 +1,29 @@
+class Solution:
+    def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
+        rows = len(grid)
+        cols = len(grid[0])
+        maxArea = 0
+
+        def dfs(r,c):
+            if (
+                r <0 or
+                c< 0 or
+                r>= rows or
+                c>=cols or
+                grid[r][c]==0
+            ):
+
+                return 0
+            grid[r][c]= 0
+            return(
+                1+ dfs(r+1,c)
+                + dfs(r-1, c)
+                + dfs(r, c+1)
+                + dfs(r, c-1)
+            )
+        for r in range(rows):
+            for c in range(cols):
+                if grid[r][c] == 1:
+                    area = dfs(r,c)
+                    maxArea = max(maxArea, area)
+        return maxArea

storage/stats.json

@@ -1,12 +1,16 @@
 {
-    "total": 122,
+    "total": 123,
     "easy": 63,
-    "medium": 53,
+    "medium": 54,
     "hard": 6,
     "languages": {
-        "Python3": 6
+        "Python3": 7
     },
     "recent_problems": [
+        {
+            "id": "695",
+            "title": "Max Area Of Island"
+        },
         {
             "id": "200",
             "title": "Number Of Islands"
@@ -22,18 +26,14 @@
         {
             "id": "295",
             "title": "Find Median From Data Stream"
-        },
-        {
-            "id": "1",
-            "title": "Two Sum"
         }
     ],
     "last_problem": {
-        "id": "200",
-        "title": "Number Of Islands",
+        "id": "695",
+        "title": "Max Area Of Island",
         "language": "Python3",
-        "runtime": "252 ms",
-        "memory": "21.6 MB"
+        "runtime": "22 ms",
+        "memory": "20.7 MB"
     },
-    "last_sync": "2026-07-03 14:03:07"
+    "last_sync": "2026-07-04 19:12:15"
 }