Dynamic programming (DP)

Also written: dynamic programming, DP

Solving each overlapping subproblem once and saving the answer, with a memo or a table. It fixes recursion that repeats work, like the fewest-bags problem.