CSE201, Winter 2025, Lec 7: Longest Common Subsequence
C. Seshadhri · 78:04
This lecture derives the classic longest-common-subsequence (LCS) dynamic-programming algorithm from first principles: prove a two-case recurrence on the last characters of strings \(A\) (length \(m\)) and \(B\) (leng...