Dynamic programming (DP) is breaking down an optimization problem into smaller sub-problems, and sorting the solution to each sub-problems so that each sub-problem is only solved once.
Dynamic programming (DP) is breaking down an optimization problem into smaller sub-problems, and sorting the solution to each sub-problems so that each sub-problem is only solved once.