Leetcode 2539. Count the Number of Good Subsequences

Count how many subsequences of a given sequence/string satisfy the problem's "good" criterion (typically non-trivial pattern or property) — return the total (usually modulo 10^9+7). This generally requires dynamic programming or combinatorics to accumulate subsequence counts efficiently while handling duplicates and large input sizes rather than brute-force enumeration.