Skip to content

Glossary: Algorithms Beyond the Basics in Go

Longest common subsequence

The longest sequence of items that appears in the same order, though not necessarily side by side, in two inputs. It is a classic dynamic programming problem solved with a 2D table.

Where the book teaches it

Related terms

Edit distance