NeetCode #776LC-1749MediumGreedy
← Back to All Problems#776 · #1749 · Maximum Absolute Sum of Any Subarray(任意子数组和的绝对值的最大值)
📌 Problem Statement & Constraints
Given an integer array
nums, return the maximum absolute sum of any subarray (the subarray may be empty, giving 0). Constraints: 1 <= nums.length <= 10^5, -10^4 <= nums[i] <= 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!