SG
← Back

String DP

Edit distance, palindrome partitioning, subsequence counts.

dpstringsUpdated 2025-09-01

Edit Distance

  • dp[i][j] = min(ins,del,rep)

Pal Partition

  • dp[i] = 1+min(dp[j-1]) for pal(j..i)