📄️ Introduction
An Overview of Dynamic Programming.
📄️ Memoization
Introduction to Memoization in Dynamic Programming.
📄️ Bottom-up Approach
Introduction to The Bottom-up Approach in Dynamic Programming.
📄️ Number of Ways Up the Stair
Count the number of ways to go up a n-th stair using dynamic programming.
📄️ Minimum Cost Up the Stair
Solve the a modified version of the number of ways up the stair problem.
📄️ Unique Paths to Corner
Count the number of unique paths to reach the bottom right corner.
📄️ Edit Distance
With the given operations, minimize the number of operations to make 2 strings equal.
📄️ 0-1 Knapsack Problem
Knapsack problem involves resource allocation to maximize the profit.