Leetcode 1749. Maximum Absolute Sum of Any Subarray

Find the maximum absolute sum of any contiguous subarray (possibly empty) in an integer array — i.e., the maximum of the largest subarray sum and the absolute of the smallest subarray sum. This is solved in linear time by a Kadane-like scan that tracks running max and min subarray sums.