Maximum Number of Non-Overlapping Substrings

Given a lowercase alphabet string s, return the maximum number of non-overlapping substrings that satisfy the following conditions:

The substrings are non-empty and non-overlapping. A substring can be included multiple times in the result if it satisfies condition 1. The characters of each substring must be the same.