Longest Duplicate Substring - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
1044. Longest Duplicate Substring
Hard
50 Points
String
Binary Search
Sliding Window
Rolling Hash
Suffix Array
Hash Function
Given a string s, consider all duplicated substrings: (contiguous) substrings of s that occur 2 or more times. The occurrences may overlap.
Return any duplicated substring that has the longest possible length. If s does not have a duplicated substring, the answer is "".
Examples
Example 1
Input: s = "banana"
Output: "ana"
Example 2
Input: s = "abcd"
Output: ""
Constraints
2 <= s.length <= 3 * 104
s consists of lowercase English letters.
1044. Longest Duplicate Substring
Hard
50 Points
String
Binary Search
Sliding Window
Rolling Hash
Suffix Array
Hash Function
Given a string s, consider all duplicated substrings: (contiguous) substrings of s that occur 2 or more times. The occurrences may overlap.
Return any duplicated substring that has the longest possible length. If s does not have a duplicated substring, the answer is "".