Find Maximum Number of Non Intersecting Substrings - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3557. Find Maximum Number of Non Intersecting Substrings
Medium
30 Points
Hash Table
String
Dynamic Programming
Greedy
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.
Examples
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
1 <= word.length <= 2 * 105
word consists only of lowercase English letters.
3557. Find Maximum Number of Non Intersecting Substrings
Medium
30 Points
Hash Table
String
Dynamic Programming
Greedy
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.
Examples
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.