Solution: Count the Number of Good Subsequences
Solution: Count the Number of Good Subsequences asks you to count nonempty subsequences of a string whose characters all occur with the same frequency, returning the result modulo a large prime.
We'll cover the following...
We'll cover the following...
Statement
Count and return the number of good subsequences in the given string s. You may return the modulo
A subsequence is a sequence formed from another sequence by deleting some or no elements while keeping the order of the remaining elements unchanged.
A good subsequence is a subsequence of a string if it is not empty and the frequency of each character is the same.
Constraints:
s.lengthswill only contain ...