CSE201, Winter 2025, Lec6, Part 2: Longest Common Subsequence
C. Seshadhri · 11:40
This lecture introduces the longest common subsequence (LCS) as a classic dynamic programming problem: given two strings, find the length of the longest sequence that can be formed from both by dropping characters whi...