Dynamic Programming

• The technique of using memoization on divide & conquer algorithms that have repeated subproblems
• E.g., fibonacci recursive solution
• Dynamic programming is not applied with memoization only!
• It's about knowing the subproblems