Skip to content

Glossary: Algorithms Beyond the Basics in Rust

Longest common subsequence

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

Where the book teaches it

Related terms

Edit distanceDynamic programming