feat(leetcode): solve 133 - Clone Graph

Author: arnav-on-code

README.md

@@ -9,33 +9,37 @@ Automatically synchronize accepted LeetCode submissions to GitHub.
 ```text
 ████████████░░░░░░░░░░░░░░░░░░
 
-Solved: 121 / 300 Problems
+Solved: 122 / 300 Problems
 
 📊 Statistics
 Difficulty	Solved
 🟢 Easy	63
-🟡 Medium	52
+🟡 Medium	53
 🔴 Hard	6
-Total	121
+Total	122
 🔥 Latest Accepted Problem
 
 
 | Field | Value |
 |------|------|
-| Problem ID | 200 |
-| Title | Number Of Islands |
+| Problem ID | 133 |
+| Title | Clone Graph |
 | Language | Python3 |
-| Runtime | 252 ms |
-| Memory | 21.6 MB |
+| Runtime | 49 ms |
+| Memory | 19.8 MB |
 
 
 💻 Languages Used
 
-- **Python3** : 1
+- **Python3** : 5
 
 ## 📚 Recent Accepted Problems
 
-- 200 Number Of Islands
+- 133 Clone Graph
+- 1 Two Sum
+- 295 Find Median From Data Stream
+- 1 Two Sum
+- 295 Find Median From Data Stream
 
 
 ---
@@ -77,4 +81,4 @@ Git
 GitHub
 ⏰ Last Sync
 
-2026-07-03 09:17:32
+2026-07-03 14:03:05

storage/solutions/0133_Clone_Graph/metadata.json

@@ -0,0 +1,11 @@
+{
+    "submission_id": "2054682645",
+    "question_id": "133",
+    "title_slug": "clone-graph",
+    "language": "python3",
+    "language_verbose": "Python3",
+    "runtime": "49 ms",
+    "memory": "19.8 MB",
+    "status_code": 10,
+    "timestamp": 1783084243
+}

storage/solutions/0133_Clone_Graph/solution.py

@@ -0,0 +1,26 @@
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val = 0, neighbors = None):
+        self.val = val
+        self.neighbors = neighbors if neighbors is not None else []
+"""
+
+from typing import Optional
+class Solution:
+    def cloneGraph(self, node: Optional['Node']) -> Optional['Node']:
+        if not node:
+            return None
+        visited = {}
+
+        def dfs(node):
+            if node in visited:
+                return visited[node]
+            copy = Node(node.val)
+
+            visited[node]=copy
+
+            for neighbor in node.neighbors:
+                copy.neighbors.append(dfs(neighbor))
+            return copy
+        return dfs(node)

storage/stats.json

@@ -1,12 +1,16 @@
 {
-    "total": 0,
-    "easy": 0,
-    "medium": 0,
-    "hard": 0,
+    "total": 122,
+    "easy": 63,
+    "medium": 53,
+    "hard": 6,
     "languages": {
-        "Python3": 4
+        "Python3": 5
     },
     "recent_problems": [
+        {
+            "id": "133",
+            "title": "Clone Graph"
+        },
         {
             "id": "1",
             "title": "Two Sum"
@@ -25,11 +29,11 @@
         }
     ],
     "last_problem": {
-        "id": "1",
-        "title": "Two Sum",
+        "id": "133",
+        "title": "Clone Graph",
         "language": "Python3",
-        "runtime": "45 ms",
-        "memory": "17 MB"
+        "runtime": "49 ms",
+        "memory": "19.8 MB"
     },
-    "last_sync": "2026-07-02 12:18:27"
+    "last_sync": "2026-07-03 14:03:05"
 }