Skip to content

Glossary: Algorithms Beyond the Basics in Go

Dynamic programming

Also written: DP

Solving a problem by building on answers to smaller overlapping problems that are each worked out once. It works either top-down with a memo or bottom-up with a table.

Where the book teaches it

Related terms

Overlapping subproblemsOptimal substructureMemoizationBottom-up