Subsequence DP
LCS, LIS, edit distance patterns over indices.
dpsubsequenceUpdated 2025-09-01
LCS
- dp[i][j] = 1+dp[i-1][j-1] if match else max(dp[i-1][j],dp[i][j-1])
LIS
- dp[i] = max(dp[j]+1) for j<i & a[j]<a[i]
LCS, LIS, edit distance patterns over indices.