↗Dynamic programming

Build answers from smaller ones in memoization, knapsack, longest common subsequence, and edit distance. — 5 entries

Stores answers to overlapping subproblems so each is solved only once.

Caches a function result by input and reuses it on repeated calls.

Chooses each item at most once to maximize value within a capacity.

Finds the longest sequence shared in order, allowing skipped characters.

The minimum number of insertions, deletions, and substitutions between strings.