Distinct Subsequences: Counting Subsequences DP
The Distinct Subsequences problem (LeetCode 115) asks a deceptively simple question: given a source string s and a target string t, count how many distinct subsequences of s equal t.
The Distinct Subsequences problem (LeetCode 115) asks a deceptively simple question: given a source string s and a target string t, count how many distinct subsequences of s equal t.