Maximum Number of Non-Overlapping Substrings — LeetCode 1520 Python Solution

The problem

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 < x or i > y is true. A substring that contains a certain character c must also contain all occurrences of c.

Example

Input

s = "adefaddaccc"

Output

["e","f","ccc"]

Explanation

The following are all the possible substrings that meet the conditions:

Complexity

Pattern: Greedy

Take the locally best option every time — when you can prove that never costs you later. LeetCode 1520. Maximum Number of Non-Overlapping Substrings is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Greedy.

The greedy guide has the Python template for the pattern and the 346 LeetCode problems that use it.

Related problems