Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
Bookmark
Brute Force
Sorted Map
Monotonic Deques
Input
Standard
Example 2
Limit = 0
Custom
nums
=
[8, 2, 4, 7]
,
limit
=
4
maxLen =
0
8
2
4
7
0
1
2
3
try every start; extend while max − min ≤ 4
maxLen =
0
8
2
4
7
0
1
2
3
try every start; extend while max − min ≤ 4
spread =
0
(≤ 4?)
maxLen =
1
8
2
4
7
0
1
2
3
min
i
best = 1
new start at
i = 0
spread =
6
(≤ 4?)
maxLen =
1
8
2
4
7
0
1
2
3
min
max
i
j
best = 1
spread =
8
−
2
=
6
stop
spread =
0
(≤ 4?)
maxLen =
1
8
2
4
7
0
1
2
3
min
i
best = 1
new start at
i = 1
spread =
2
(≤ 4?)
maxLen =
2
8
2
4
7
0
1
2
3
min
max
i
j
best = 2
spread =
4
−
2
=
2
new best!
spread =
5
(≤ 4?)
maxLen =
2
8
2
4
7
0
1
2
3
min
max
i
j
best = 2
spread =
7
−
2
=
5
stop
spread =
0
(≤ 4?)
maxLen =
2
8
2
4
7
0
1
2
3
min
i
best = 2
new start at
i = 2
spread =
3
(≤ 4?)
maxLen =
2
8
2
4
7
0
1
2
3
min
max
i
j
best = 2
spread =
7
−
4
=
3
ok
spread =
0
(≤ 4?)
maxLen =
2
8
2
4
7
0
1
2
3
min
i
best = 2
new start at
i = 3
maxLen =
2
8
2
4
7
0
1
2
3
best = 2
answer =
2
algo
master
.
io
Step:
Brute force: try every start, extend while |max - min| <= 4.
0 / 9
Input
Standard
Example 2
Limit = 0
Custom
nums
=
[8, 2, 4, 7]
,
limit
=
4
0 / 9
algo
master
.
io
Step:
Brute force: try every start, extend while |max - min| <= 4.
