Dynamic Programming

What is Dynamic Programming?

Dynamic Programming is a method of Programming which involves Recursion and Caching. It is useful when loops are involved and where you have to calculate a lot of code and expressions. Dynamic Programming accomplishes this quickly by recursively breaking the expression down and calculating each small part. Lots of different interview and competition problems involve Dynamic Programming.

It is useful in many recursion problems and problems in which you need to try many different orientations of objects or loop through sub-objects.

Different Aspects of Dynamic Programming

Dynamic Programming is actually a huge section of Data Structures and Algorithms. Here are some concepts you need to know (we'll go over them):

• Recursion
• Caching
  • Memoization