String DP

Synopsis

We will use dynamic programming to solve two classic string problems:

  • Levinstein (Edit) Distance
  • Longest Common Subsequence

Slides

In-class Problems