Computer ScienceData Structures & Algorithms
Dynamic Programming: Memoisation and the Fibonacci Problem
2,341 views 1h 12m July 15, 2024
Overview
Develop a thorough understanding of dynamic programming starting from the classic Fibonacci problem. We build intuition for identifying optimal substructure and overlapping subproblems.
Key Concepts
- Optimal substructure
- Overlapping subproblems
- Top-down memoisation
- Bottom-up tabulation
Resources
Dynamic ProgrammingMemoisationDSAAlgorithms