Dynamic programming is the process of breaking down a larger problem into smaller problems. By using the answers to those smaller problems, we can find the overall solution more efficiently. We'll also learn about the term "memoization," and how it relates to dynamic programming. The Fibonacci Sequence is a good example of dynamic programming, so we'll use it too.
Sort: