Leetcode 1520. Maximum Number of Non-Overlapping Substrings

For each character, determine the smallest substring that contains all occurrences of that character (and thus any characters inside it), producing candidate intervals; then choose the maximum number of non-overlapping intervals (breaking ties by minimum total length) — an interval construction plus interval-scheduling/greedy selection problem.