feat(leetcode): solve 104 - Maximum Depth Of Binary Tree

Author: arnav-on-code

README.md

@@ -22,24 +22,24 @@ Total	125
 
 | Field | Value |
 |------|------|
-| Problem ID | 235 |
-| Title | Lowest Common Ancestor Of A Binary Search Tree |
+| Problem ID | 104 |
+| Title | Maximum Depth Of Binary Tree |
 | Language | Python3 |
-| Runtime | 66 ms |
-| Memory | 22.8 MB |
+| Runtime | 0 ms |
+| Memory | 20.3 MB |
 
 
 💻 Languages Used
 
-- **Python3** : 24
+- **Python3** : 25
 
 ## 📚 Recent Accepted Problems
 
+- 104 Maximum Depth Of Binary Tree
 - 235 Lowest Common Ancestor Of A Binary Search Tree
 - 124 Binary Tree Maximum Path Sum
 - 789 Kth Largest Element In A Stream
 - 1127 Last Stone Weight
-- 1014 K Closest Points To Origin
 
 
 ---
@@ -81,4 +81,4 @@ Git
 GitHub
 ⏰ Last Sync
 
-2026-07-06 19:56:24
+2026-07-06 19:56:26

storage/solutions/0104_Maximum_Depth_Of_Binary_Tree/metadata.json

@@ -0,0 +1,11 @@
+{
+    "submission_id": "2045552347",
+    "question_id": "104",
+    "title_slug": "maximum-depth-of-binary-tree",
+    "language": "python3",
+    "language_verbose": "Python3",
+    "runtime": "0 ms",
+    "memory": "20.3 MB",
+    "status_code": 10,
+    "timestamp": 1782377105
+}

storage/solutions/0104_Maximum_Depth_Of_Binary_Tree/solution.py

@@ -0,0 +1,13 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def maxDepth(self, root: Optional[TreeNode]) -> int:
+        if not root:
+            return 0
+        leftDepth= self.maxDepth(root.left)
+        rightDepth=self.maxDepth(root.right)
+        return 1+ max(leftDepth, rightDepth)

storage/state.json

@@ -1,3 +1,3 @@
 {
-    "last_submission_id": "2048068140"
+    "last_submission_id": "2046953410"
 }

storage/stats.json

@@ -4,9 +4,13 @@
     "medium": 56,
     "hard": 6,
     "languages": {
-        "Python3": 24
+        "Python3": 25
     },
     "recent_problems": [
+        {
+            "id": "104",
+            "title": "Maximum Depth Of Binary Tree"
+        },
         {
             "id": "235",
             "title": "Lowest Common Ancestor Of A Binary Search Tree"
@@ -22,18 +26,14 @@
         {
             "id": "1127",
             "title": "Last Stone Weight"
-        },
-        {
-            "id": "1014",
-            "title": "K Closest Points To Origin"
         }
     ],
     "last_problem": {
-        "id": "235",
-        "title": "Lowest Common Ancestor Of A Binary Search Tree",
+        "id": "104",
+        "title": "Maximum Depth Of Binary Tree",
         "language": "Python3",
-        "runtime": "66 ms",
-        "memory": "22.8 MB"
+        "runtime": "0 ms",
+        "memory": "20.3 MB"
     },
-    "last_sync": "2026-07-06 19:56:24"
+    "last_sync": "2026-07-06 19:56:26"
 }