Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Maximum Average Subarray I
Bookmark
Brute Force
Sliding Window
Input
Example 1
Window size 1
All negative
Custom
nums
=
[1, 12, -5, -6, 50, 3]
,
k
=
4
k =
4
0
1
2
3
4
5
1
12
-5
-6
50
3
k =
4
0
1
2
3
4
5
1
12
-5
-6
50
3
k =
4
0
1
2
3
4
5
window
1
12
-5
-6
50
3
sum =
0
+
1
=
1
k =
4
0
1
2
3
4
5
window
1
12
-5
-6
50
3
sum =
13
+
(-5)
=
8
k =
4
maxAvg =
0.50
0
1
2
3
4
5
window
best
1
12
-5
-6
50
3
maxAvg =
2
/
4
=
0.50
k =
4
maxAvg =
0.50
0
1
2
3
4
5
window
best
1
12
-5
-6
50
3
sum =
12
+
(-5)
=
7
k =
4
maxAvg =
0.50
0
1
2
3
4
5
window
best
1
12
-5
-6
50
3
sum =
7
+
(-6)
=
1
k =
4
maxAvg =
12.75
0
1
2
3
4
5
window
best
1
12
-5
-6
50
3
51
>
2
new best
maxAvg =
12.75
k =
4
maxAvg =
12.75
0
1
2
3
4
5
window
best
1
12
-5
-6
50
3
sum =
(-5)
+
(-6)
=
-11
k =
4
maxAvg =
12.75
0
1
2
3
4
5
window
best
1
12
-5
-6
50
3
sum =
39
+
3
=
42
k =
4
maxAvg =
12.75
0
1
2
3
4
5
best
1
12
-5
-6
50
3
maxAvg =
12.75
window [1..4]
algo
master
.
io
Step:
Start of algorithm
0 / 17
Input
Example 1
Window size 1
All negative
Custom
nums
=
[1, 12, -5, -6, 50, 3]
,
k
=
4
0 / 17
algo
master
.
io
Step:
Start of algorithm
