text and three integers max_distinct, min_len and max_len. A fragment is a non-empty run of consecutive characters of the string.
A fragment is allowed when:
- its length is at least min_len and at most max_len;
- it contains at most max_distinct different letters.
Find the allowed fragment that occurs in text the most times and return how many times it occurs. Occurrences may overlap. If no fragment is allowed, return 0.text='abcabcab', max_distinct=3, min_len=2, max_len=3 → 3
The fragment "ab" occurs three times (starting at 0, 3 and 6), and no other allowed fragment occurs more often.
text='zzzzz', max_distinct=1, min_len=2, max_len=4 → 4
"zz" starts at positions 0, 1, 2 and 3; occurrences may overlap, so the answer is 4.
text='abcd', max_distinct=1, min_len=2, max_len=2 → 0
Every fragment of length 2 has two different letters while only one is allowed, so no fragment qualifies.
text consists of lowercase English letters onlytext='abcabcab', max_distinct=3, min_len=2, max_len=3
3
Run checks the first 3 tests in your browser. Submit checks all 117 tests on the server, hidden ones included.