Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Longest Duplicate Substring
Bookmark
Input
"banana" → "ana"
"abcd" → ""
"aabaa" → "aa"
"abcabc" → "abc"
Custom
s
=
banana
b
a
n
a
n
a
0
1
2
3
4
5
b
a
n
a
n
a
0
1
2
3
4
5
b
a
n
a
n
a
0
1
2
3
4
5
len
1
low
2
3
4
5
high
phase
Binary Search
hash
-
result
""
window
b
a
n
a
n
a
0
1
2
3
4
5
len
1
low
2
3
4
5
high
phase
Rabin-Karp (len=3)
hash
689
result
""
window
b
a
n
a
n
a
0
1
2
3
4
5
len
1
low
2
3
4
5
high
phase
Rabin-Karp (len=3)
hash
8801
result
""
match
window
b
a
n
a
n
a
0
1
2
3
4
5
len
1
low
2
3
4
5
high
phase
Rabin-Karp (len=3)
hash
338
result
""
b
a
n
a
n
a
0
1
2
3
4
5
len
1
2
3
4
low
5
high
phase
Binary Search
hash
-
result
"ana"
window
b
a
n
a
n
a
0
1
2
3
4
5
len
1
2
3
4
low
5
high
phase
Rabin-Karp (len=4)
hash
17914
result
"ana"
window
b
a
n
a
n
a
0
1
2
3
4
5
len
1
2
3
4
low
5
high
phase
Rabin-Karp (len=4)
hash
228826
result
"ana"
b
a
n
a
n
a
0
1
2
3
4
5
len
1
2
3
4
low
5
high
phase
Rabin-Karp (len=4)
hash
228826
result
"ana"
b
a
n
a
n
a
0
1
2
3
4
5
len
1
2
3
4
5
phase
Done
hash
-
result
"ana"
algo
master
.
io
Step:
Start: Find the longest duplicate substring in "banana"
0 / 14
Input
"banana" → "ana"
"abcd" → ""
"aabaa" → "aa"
"abcabc" → "abc"
Custom
s
=
banana
0 / 14
algo
master
.
io
Step:
Start: Find the longest duplicate substring in "banana"
