Merge pull request #3 from iamAntimPal/Leetcode-75

Leetcode 75

Author: iamAntimPal

Solution/1161. Maximum Level Sum of a Binary Tree/1161. Maximum Level Sum of a Binary Tree.py

@@ -0,0 +1,25 @@
+# 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 maxLevelSum(self, root: Optional[TreeNode]) -> int:
+        q = deque([root])
+        mx = -inf
+        i = 0
+        while q:
+            i += 1
+            s = 0
+            for _ in range(len(q)):
+                node = q.popleft()
+                s += node.val
+                if node.left:
+                    q.append(node.left)
+                if node.right:
+                    q.append(node.right)
+            if mx < s:
+                mx = s
+                ans = i
+        return ans