Dynamic programming

Also written: DP

Solving a problem by building on answers to smaller problems that repeat, saving each so it is worked out only once. It applies when there are overlapping subproblems and optimal substructure.