Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Longest Substring with At Least K Repeating Characters
Bookmark
Brute Force
Divide & Conquer
Sliding Window
Input
Input 1
Input 2
Input 3
Custom
s
=
aaabb
,
k
=
3
0
1
2
3
4
a
a
a
b
b
0
1
2
3
4
a
a
a
b
b
0
1
2
3
4
a
a
a
b
b
left
right
include s[
1
] =
'a'
a
1
/3
0
1
2
3
4
max_len = 3
a
a
a
b
b
left
right
3
>
0
new best
maxLen =
3
a
3
/3
0
1
2
3
4
max_len = 3
a
a
a
b
b
left
right
freq['
b
'] =
2
a
3
/3
b
2
/3
0
1
2
3
4
max_len = 3
a
a
a
b
b
left
right
include s[
2
] =
'a'
a
1
/3
0
1
2
3
4
max_len = 3
a
a
a
b
b
left
right
include s[
4
] =
'b'
a
2
/3
b
1
/3
0
1
2
3
4
max_len = 3
a
a
a
b
b
left
right
deficient chars =
1
not valid
a
1
/3
0
1
2
3
4
max_len = 3
a
a
a
b
b
left
right
freq['
b
'] =
2
a
1
/3
b
2
/3
0
1
2
3
4
max_len = 3
a
a
a
b
b
left
right
freq['
b
'] =
2
b
2
/3
0
1
2
3
4
max_len = 3 "aaa"
a
a
a
b
b
maxLen =
3
algo
master
.
io
Step:
Start of algorithm
0 / 48
Input
Input 1
Input 2
Input 3
Custom
s
=
aaabb
,
k
=
3
0 / 48
algo
master
.
io
Step:
Start of algorithm
