Skip to content

Glossary: Algorithms Beyond the Basics in Rust

Edit distance

The smallest number of single-letter changes (insertions, deletions or substitutions) needed to turn one word into another. It is a classic 2D dynamic programming problem.

Where the book teaches it

Related terms

Longest common subsequenceDynamic programming