Package g3501_3600.s3557_find_maximum_number_of_non_intersecting_substrings

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3557 - Find Maximum Number of Non Intersecting Substrings.

    Medium

    You are given a string word.

    Return the maximum number of non-intersecting substring of word that are at least four characters long and start and end with the same letter.

    Example 1:

    Input: word = "abcdeafdef"

    Output: 2

    Explanation:

    The two substrings are "abcdea" and "fdef".

    Example 2:

    Input: word = "bcdaaaab"

    Output: 1

    Explanation:

    The only substring is "aaaa". Note that we cannot also choose "bcdaaaab" since it intersects with the other substring.

    Constraints:

    • <code>1 <= word.length <= 2 * 10<sup>5</sup></code>

    • word consists only 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 Integer maxSubstrings(String s)

      • Methods inherited from class java.lang.Object

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