Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Maximum Sum of Distinct Subarrays With Length K
Bookmark
Brute Force
Sliding Window
Input
Example 1
All Same
All Distinct
Duplicates Then Distinct
Custom
nums
=
[1, 5, 4, 2, 9, 9, 9]
,
k
=
3
k =
3
0
1
2
3
4
5
6
1
5
4
2
9
9
9
k =
3
0
1
2
3
4
5
6
1
5
4
2
9
9
9
k =
3
sum =
1
maxSum =
0
0
1
2
3
4
5
6
window
1
5
4
2
9
9
9
seen
1
×1
sum =
0
+
1
=
1
k =
3
sum =
10
maxSum =
10
0
1
2
3
4
5
6
window
best
1
5
4
2
9
9
9
seen
1
×1
4
×1
5
×1
all distinct
10
>
0
new best
k =
3
sum =
9
maxSum =
10
0
1
2
3
4
5
6
window
best
1
5
4
2
9
9
9
seen
4
×1
5
×1
sum =
5
+
4
=
9
k =
3
sum =
4
maxSum =
11
0
1
2
3
4
5
6
window
best
1
5
4
2
9
9
9
seen
4
×1
sum =
0
+
4
=
4
k =
3
sum =
15
maxSum =
11
0
1
2
3
4
5
6
window
best
1
5
4
2
9
9
9
seen
2
×1
4
×1
9
×1
sum =
6
+
9
=
15
k =
3
sum =
11
maxSum =
15
0
1
2
3
4
5
6
window
best
1
5
4
2
9
9
9
seen
2
×1
9
×1
sum =
2
+
9
=
11
k =
3
sum =
20
maxSum =
15
0
1
2
3
4
5
6
window
best
1
5
4
2
9
9
9
seen
2
×1
9
×2
2 distinct
<
3
skip window
k =
3
sum =
27
maxSum =
15
0
1
2
3
4
5
6
window
best
1
5
4
2
9
9
9
seen
9
×3
sum =
18
+
9
=
27
duplicate
k =
3
maxSum =
15
0
1
2
3
4
5
6
best
1
5
4
2
9
9
9
seen
9
×3
maxSum =
15
window [2..4]
algo
master
.
io
Step:
Start of algorithm
0 / 22
Input
Example 1
All Same
All Distinct
Duplicates Then Distinct
Custom
nums
=
[1, 5, 4, 2, 9, 9, 9]
,
k
=
3
0 / 22
algo
master
.
io
Step:
Start of algorithm
