Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Understand and apply algorithms
·
Module 11
Introduction to Dynamic Programming
1
Recognizing DP Opportunities
Identify problems with optimal substructure and overlapping subproblems, where DP is applicable.
2
Brute-Force Recursion for Climbing Stairs
Formulate a brute-force recursive solution for a problem like 'Climbing Stairs'.
3
Memoization for Recursive Solutions
Apply memoization (top-down DP) to a recursive solution to avoid re-computing subproblems.
Memoization in Dynamic Programming
Implement a memoized solution to a classic DP problem.
5
Tabulation: Bottom-Up Dynamic Programming
Explain the concept of tabulation (bottom-up DP) as an alternative to memoization.
Dynamic Programming: Tabulation Basics
Implement a tabulated solution to a classic DP problem.
Previous module
Graph Algorithms
Next module
Technical Interview Skills