Skip to content

Glossary: Algorithms Beyond the Basics in C++

longest common subsequence

A classic dynamic programming problem: find the longest sequence of items that appears in the same order, though not necessarily side by side, in two inputs.

Where the book teaches it

Related terms

edit distance