PEC-CSS/Open-Source

Longest Duplicate Substring

Gauravsharma-20 opened this issue · 4 comments

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:

Input: s = "banana"
Output: "ana"

Input: s = "abcd"
Output: ""

Constraints:
2 <= s.length <= 3 * 104
s consists of lowercase English letters.

I would like to work on this. Please assign it to me.

Hi, I would like to work on this problem .Can I .

@Meghwantsingh this has already been assigned, please look for another issue.