Problem 115 · Hard

Distinct Subsequences

2D DP: dp[i][j] counts ways to form t[0..j-1] from s[0..i-1] using or skipping matched characters.

Open the interactive visualisation