Time: 0 ms (100%), Space: 45 MB (97.17%) - LeetHub

Author: MishkatIT

1749-maximum-absolute-sum-of-any-subarray/1749-maximum-absolute-sum-of-any-subarray.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int maxAbsoluteSum(vector<int>& nums) {
+        int ans = 0;
+        int n = nums.size();
+        int temp = 0;
+        for (int i = 0; i < n; i++) {
+            temp += nums[i];
+            if (temp > 0) temp = 0;
+            ans = max(ans, -temp);
+        }
+        temp = 0;
+        for (int i = 0; i < n; i++) {
+            temp += nums[i];
+            if (temp < 0) temp = 0;
+            ans = max(ans, temp);
+        }
+        return ans;
+    }
+};