Longest common subsequence
Also known as LCS, Longest common subsequence DP. This is the canonical page; those names redirect here.
Two live units share this canonical name and are genuinely distinct lessons: the plain DP for sequence similarity, and Hunt-Szymanski for diff computation.
Pairings in the atlas
- standalonecanonSequence similaritydynamic-programming
- Hunt-Szymanski matchingstandardDiff computationstrings