Slides:
https://www2.compute.dtu.dk/courses/02110/2023/slides/DP1-1x1.pdf
Problems:
https://www2.compute.dtu.dk/courses/02110/2023/weekplans/dp1.pdf
• KT 6.1, 6.2
Memoization: a reminder, store duplicate subproblems
Tabulation
Fibbonnaci er 2^n
If you have the 5th fibonacci number once it can be reused somewhere else.
Overlapping subproblems is known as dynamic programming
You have a large problem and you try to decompose it into smaller instances of the same subproblem.
