Maximum Absolute Sum Of Any Subarray
Maximum Absolute Sum of Any Subarray: Use Kadane's algorithm to find max & min subarray sums. Result = max(abs(max sum), abs(min sum)). Efficiently computes result in linear time.
1749. Maximum Absolute Sum of Any Subarray Difficulty: Medium Topics: Array, Dynamic Programming You are given an integer array nums. The absolute sum of a subarray [numsl, numsl+1, ..., numsr-1, numsr] is abs(numsl + numsl+1 + ... + numsr-1 + numsr). Return the maximum absolute sum of any (possibly empty) subarray of nums. Note that abs(x) is defined as follows: If x is a negative integer, then abs(x) = -x. If x is a non-negative integer, then abs(x) = x. Example 1: Input: nums = [1,-3,2,3,-4] Output: 5 Explanation: The subarray [2,3] has absolute sum = abs(2+3) = abs(5) = 5. Example 2:...