Leetcode 115. Distinct Subsequences

Count the number of distinct subsequences of s that equal t — i.e., the number of ways to delete characters from s (keeping relative order) to form t. With |s|,|t| ≤ 1000 and the answer fitting in a 32-bit integer, this is the classic DP counting problem.