hardBinary SearchHash FunctionRolling HashSliding WindowStringSuffix Array 0 views
Longest Duplicate Substring
Given a string s, consider all duplicated substrings: (contiguous) substrings of s that occur 2 or more times.
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 "".
Example 1
Input: s = "banana"
Output: "ana"
Example 2
Input: s = "abcd"
Output: ""
Constraints
- 2 <= s.length <= 3 * 10^4
- s consists of lowercase English letters.
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.