Find Maximum Number of Non Intersecting Substrings
You are given a string word.
Return the maximum number of non-intersecting substrings of word that are at least four characters long and start and end with the same letter.
Example 1
Input
word = "abcdeafdef"Output
2The two substrings are
"abcdea" and "fdef".Example 2
Input
word = "bcdaaaab"Output
1The only substring is
"aaaa"; we cannot also choose "bcdaaaab" since it intersects with the other substring.Constraints
- 1 <= word.length <= 2 * 10^5
- word consists only of lowercase English letters.