Package g1001_1100.s1044_longest_duplicate_substring

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1044 - Longest Duplicate Substring.

    Hard

    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:

    • <code>2 <= s.length <= 3 * 10<sup>4</sup></code>

    • s consists of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String longestDupSubstring(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait