Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Maximum Absolute Sum of Any Subarray
Bookmark
Brute Force
Kadane's
Prefix Sum
Input
Classic
Negative Wins
All Positive
Custom
nums
=
[1, -3, 2, 3, -4]
0
1
2
3
4
1
-3
2
3
-4
0
1
2
3
4
1
-3
2
3
-4
sum =
-2
|sum| =
2
best =
2
0
1
2
3
4
1
-3
2
3
-4
j
i
[0..1] |sum| = |
(-2)
| =
2
new best
sum =
3
|sum| =
3
best =
3
0
1
2
3
4
1
-3
2
3
-4
j
i
[0..3] |sum| = |
3
| =
3
new best
sum =
-1
|sum| =
1
best =
3
0
1
2
3
4
1
-3
2
3
-4
j
i
[0..4] |sum| = |
(-1)
| =
1
sum =
-1
|sum| =
1
best =
3
0
1
2
3
4
1
-3
2
3
-4
j
i
[1..2] |sum| = |
(-1)
| =
1
sum =
-2
|sum| =
2
best =
3
0
1
2
3
4
1
-3
2
3
-4
j
i
[1..4] |sum| = |
(-2)
| =
2
sum =
5
|sum| =
5
best =
5
0
1
2
3
4
1
-3
2
3
-4
j
i
[2..3] |sum| = |
5
| =
5
new best
sum =
1
|sum| =
1
best =
5
0
1
2
3
4
1
-3
2
3
-4
j
i
[2..4] |sum| = |
1
| =
1
sum =
-1
|sum| =
1
best =
5
0
1
2
3
4
1
-3
2
3
-4
j
i
[3..4] |sum| = |
(-1)
| =
1
sum =
-
best =
5
0
1
2
3
4
1
-3
2
3
-4
Max |sum| =
5
algo
master
.
io
Step:
Try every subarray: keep a running sum and track the largest absolute value.
0 / 16
Input
Classic
Negative Wins
All Positive
Custom
nums
=
[1, -3, 2, 3, -4]
0 / 16
algo
master
.
io
Step:
Try every subarray: keep a running sum and track the largest absolute value.
