Dynamic Programming

Dynamic Programming (DP) is a problem-solving technique that can be used on problems that can be broken down into subproblems. More formally, we can apply dynamic programming when the optimal substructure and overlapping substructure properties hold true.