Open In App

Dynamic Programming meaning in DSA

Dynamic Programming is defined as an algorithmic technique that is used to solve problems by breaking them into smaller subproblems and avoiding repeated calculation of overlapping subproblems and using the property that the solution of the problem depends on the optimal solution of the subproblems

Properties of Dynamic Programming:

Applications of Dynamic Programming:

Advantages of Dynamic Programming:

Disadvantages of Dynamic Programming:

What else can you read?

Article Tags :