Distinct Subsequences

This problem is part of solulu Pro

Return the number of distinct subsequences of s that equal t: the number of ways to delete characters from s so that what remains is t.