feat(leetcode): solve 124 - Binary Tree Maximum Path Sum

Author: arnav-on-code

README.md

@@ -22,24 +22,24 @@ Total	125
 
 | Field | Value |
 |------|------|
-| Problem ID | 789 |
-| Title | Kth Largest Element In A Stream |
+| Problem ID | 124 |
+| Title | Binary Tree Maximum Path Sum |
 | Language | Python3 |
-| Runtime | 16 ms |
-| Memory | 25.5 MB |
+| Runtime | 4 ms |
+| Memory | 23.9 MB |
 
 
 💻 Languages Used
 
-- **Python3** : 22
+- **Python3** : 23
 
 ## 📚 Recent Accepted Problems
 
+- 124 Binary Tree Maximum Path Sum
 - 789 Kth Largest Element In A Stream
 - 1127 Last Stone Weight
 - 1014 K Closest Points To Origin
 - 295 Find Median From Data Stream
-- 11 Container With Most Water
 
 
 ---

storage/solutions/0124_Binary_Tree_Maximum_Path_Sum/metadata.json

@@ -0,0 +1,11 @@
+{
+    "submission_id": "2048068140",
+    "question_id": "124",
+    "title_slug": "binary-tree-maximum-path-sum",
+    "language": "python3",
+    "language_verbose": "Python3",
+    "runtime": "4 ms",
+    "memory": "23.9 MB",
+    "status_code": 10,
+    "timestamp": 1782579555
+}

storage/solutions/0124_Binary_Tree_Maximum_Path_Sum/solution.py

@@ -0,0 +1,20 @@
+# 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 maxPathSum(self, root: Optional[TreeNode]) -> int:
+        self.ans=float('-inf')
+        def dfs(node):
+            if not node:
+                return 0
+            left=max(dfs(node.left),0)
+            right = max(dfs(node.right),0)
+
+            self.ans=max(self.ans, node.val+ left+ right)
+
+            return node.val + max(left, right)
+        dfs(root)
+        return self.ans

storage/state.json

@@ -1,3 +1,3 @@
 {
-    "last_submission_id": "2050286655"
+    "last_submission_id": "2050276621"
 }

storage/stats.json

@@ -4,9 +4,13 @@
     "medium": 56,
     "hard": 6,
     "languages": {
-        "Python3": 22
+        "Python3": 23
     },
     "recent_problems": [
+        {
+            "id": "124",
+            "title": "Binary Tree Maximum Path Sum"
+        },
         {
             "id": "789",
             "title": "Kth Largest Element In A Stream"
@@ -22,18 +26,14 @@
         {
             "id": "295",
             "title": "Find Median From Data Stream"
-        },
-        {
-            "id": "11",
-            "title": "Container With Most Water"
         }
     ],
     "last_problem": {
-        "id": "789",
-        "title": "Kth Largest Element In A Stream",
+        "id": "124",
+        "title": "Binary Tree Maximum Path Sum",
         "language": "Python3",
-        "runtime": "16 ms",
-        "memory": "25.5 MB"
+        "runtime": "4 ms",
+        "memory": "23.9 MB"
     },
     "last_sync": "2026-07-06 19:56:23"
 }