Count the Number of Good Subsequences

Understand how to count the number of good subsequences in a string where each character appears with equal frequency. Explore dynamic programming techniques to solve this problem efficiently while managing large counts using modulo operations. Practice implementing a solution that handles strings up to 10,000 characters.