Skip to content

Glossary: Algorithms Beyond the Basics in Go

Edit distance

The fewest single-letter changes (insertions, deletions or replacements) needed to turn one word into another. It is a classic dynamic programming problem solved with a 2D table.

Where the book teaches it

Related terms

Longest common subsequenceDynamic programming