Skip to content

Glossary: Algorithms Beyond the Basics in Java

edit distance

The fewest letter changes (insertions, deletions or replacements) 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