Maximum Number of Non-Overlapping Substrings | Java Solution | Greedy

Given a string s of lowercase letters, you need to find the maximum number of non-empty substrings of s that meet the following conditions: The substrings do not overlap, that is for any two substrin