Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Longest Duplicate Substring
Bookmark
Brute Force
Binary Search + Hash
Suffix Array
Input
"banana" → "ana"
"abcd" → ""
"aabaa" → "aa"
"abcabc" → "abc"
Custom
s
=
banana
s
b
0
a
1
n
2
a
3
n
4
a
5
len = -
seen = 0 window(s)
s
b
0
a
1
n
2
a
3
n
4
a
5
len = -
seen = 0 window(s)
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 5
seen = 0 window(s)
window at 0 is "banan"
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 5
seen = 2 window(s)
seen: "banan", "anana"
remember "anana"
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 4
seen = 0 window(s)
window at 0 is "bana"
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 4
seen = 2 window(s)
seen: "bana", "anan"
remember "anan"
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 4
seen = 3 window(s)
seen: "bana", "anan", "nana"
remember "nana"
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 3
seen = 1 window(s)
seen: "ban"
remember "ban"
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 3
seen = 2 window(s)
seen: "ban", "ana"
remember "ana"
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 3
seen = 3 window(s)
seen: "ban", "ana", "nan"
window at 3 is "ana"
s
b
0
a
1
n
2
a
3
n
4
a
5
len = 3
seen = 0 window(s)
longest duplicate = "ana"
algo
master
.
io
Step:
Find the longest substring of "banana" that appears more than once
0 / 22
Input
"banana" → "ana"
"abcd" → ""
"aabaa" → "aa"
"abcabc" → "abc"
Custom
s
=
banana
0 / 22
algo
master
.
io
Step:
Find the longest substring of "banana" that appears more than once
