1520. Maximum Number of Non-Overlapping Substrings
php
dev.to
1520. Maximum Number of Non-Overlapping Substrings Difficulty: Hard Topics: Senior Staff, Hash Table, String, Greedy, Sorting, Weekly Contest 198 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 substrings s[i..j] and s[x..y], either j or i > y is true. A substring that contains a certain character c must also contain all occurrences of c. Find the