Given a string s and an integer k, determine whether it is possible to select at least k pairwise disjoint non empty substrings such that each selected substring is special.
A substring is called special if it satisfies the following conditions:
It is non empty.
No character appearing in the substring appears anywhere outside of it in s.
The substring is not the entire string s.
Return true if at least k such pairwise disjoint special substrings can be chosen, and false otherwise.
Constraints:
s consists only of lowercase English letters.
Given a string s and an integer k, determine whether it is possible to select at least k pairwise disjoint non empty substrings such that each selected substring is special.
A substring is called special if it satisfies the following conditions:
It is non empty.
No character appearing in the substring appears anywhere outside of it in s.
The substring is not the entire string s.
Return true if at least k such pairwise disjoint special substrings can be chosen, and false otherwise.
Constraints:
s consists only of lowercase English letters.