Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Upstart
Leetcode 1749. Maximum Absolute Sum of Any Subarray
Reported Feb 10, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source