Feb 26

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Maximum Absolute Sum of Any Subarray.py

@@ -0,0 +1,21 @@
+class Solution:
+    def maxAbsoluteSum(self, nums: list[int]) -> int:
+        max_sum, min_sum = 0, 0
+        ans = 0
+        for num in nums:
+            max_sum = max(max_sum + num, 0)
+            min_sum = min(min_sum + num, 0)
+            ans = max(ans, max_sum, -min_sum)
+        return ans
+
+
+def main():
+    nums = [1, -3, 2, 3, -4]
+    assert Solution().maxAbsoluteSum(nums) == 5
+
+    nums = [2, -5, 1, -4, 3, -2]
+    assert Solution().maxAbsoluteSum(nums) == 8
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -29,7 +29,7 @@
 | February 23 | [889. Construct Binary Tree from Preorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | Medium | Unsolved |
 | February 24 | [2467. Most Profitable Path in a Tree](https://leetcode.com/problems/most-profitable-path-in-a-tree/) | Medium | Unsolved |
 | February 25 | [1524. Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/) | Medium | Solved |
-| February 26 | []() |  |  |
+| February 26 | [1749. Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | Medium | Unsolved |
 | February 27 | []() |  |  |
 | February 28 | []() |  |  |
 
@@ -38,5 +38,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 17 | 13 | 4 |
+| Medium | 18 | 13 | 5 |
 | Hard   | 1 | 1 | 0 |