Practice Longest Duplicate Substring

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#1044

LeetCode Problem

Longest Duplicate Substring

String Binary Search Sliding Window Rolling Hash Suffix Array Hash Function

Problem Statement

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 "".

Source: Longest Duplicate Substring on LeetCode. Use the original task for its coding environment and submissions.

Examples

# 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.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free