Leetcode 3458. Select K Disjoint Special Substrings

Determine whether you can choose k non-overlapping substrings (none equal to the whole string) such that every character inside each chosen substring does not appear anywhere else in s. Equivalently, pick k disjoint intervals formed from characters' first–last occurrence ranges (at most 26 letters) that don't overlap the rest of the string.