Last week I learned about the dynamic programming approach.

The dynamic programming approach is when an algorithm uses a previous result as a new parameter. I thought it as a recursion problem dealing with something like Fibonacci or Tribonacci problems where the next value of the series depend on the previous value for n.

To Identify the problem with this approach, we use this thinking:

1. Is the problem require previous value to be generated before the new series?
2. Is the problem resemble something that like Fibonacci or Tribonacci
3. Can you start with recursion and then implement memoization.