Learning Path
Blogs
Premium
Login
Feedback
Hide Index
Dynamic Programming
0% completed
Introduction to dynamic programming
Understanding the problem
Understanding dynamic programming
The formal definition of dynamic programming
The mental model for dynamic programming
The state
Definition of state
Discovering the state
The recurrence relation
The Bellman optimality equation
Deriving a recurrence relation
Verifying a recurrence relation
The base cases
Defining base cases
Identifying base cases
Verifying base cases
The order of execution
Computation order
Linear DP
Calculate factorial
Nth fibonacci number
Longest increasing subsequence
Understanding the longest increasing subsequence problem
Understanding the top down solution to the longest increasing subsequence problem
Understanding the bottom up solution to the longest increasing subsequence problem
Longest increasing subsequence
Largest sum ascending subsequence
Longest common subsequence
Understanding the longest common subsequence problem
Understanding the top-down solution to the longest common subsequence problem
Understanding the bottom-up solution to the longest common subsequence problem
Longest common subsequence
Longest common subsequence II
Longest common substring
Understanding the longest common substring problem
Understanding the top-down solution to the longest common substring problem
Understanding the bottom-up solution to the longest common substring problem
Longest common substring
Edit distance
Understanding the edit distance problem
Understanding the top-down solution to the edit distance problem
Understanding the bottom-up solution to the edit distance problem
Edit distance
Longest palindromic subsequence
Understanding the longest palindromic subsequence problem
Understanding the top down solution to the longest palindromic subsequence problem
Understanding the bottom up solution to the longest palindromic subsequence problem
Longest palindromic subsequence
Longest palindromic substring
Understanding the longest palindromic substring problem
Understanding the top down solution to the longest palindromic substring problem
Understanding the bottom up solution to the longest palindromic substring problem
Palindrome partitioning
Understanding the palindrome partitioning problem
Understanding the top down solution to the palindrome partitioning problem
Understanding the bottom up solution to the palindrome partitioning problem
Minimum partitioning
Word break
0/1 Knapsack
Understanding the 0/1 knapsack problem
Understanding the top down solution to the 0/1 knapsack problem
Understanding the bottom up solution to the 0/1 knapsack problem
Zero one knapsack
Zero one Knapsack II
Subset sum
Unbounded Knapsack
Understanding the unbounded knapsack problem
Understanding the top down solution to the unbounded knapsack problem
Understanding the bottom up solution to the unbounded knapsack problem
Rod cutting
Coin change
Bounded Knapsack
Understanding the bounded knapsack problem
Understanding the top down solution to the bounded knapsack problem
Understanding the bottom up solution to the bounded knapsack problem
Counting Knapsack
Coin change II
Matrix chain multiplication
Understanding the matrix chain multiplication problem
Matrix chain multiplication
Pattern: Edit distance
Wildcard pattern matching
Interleaving Check
Pattern: Subset sum
Partition with equal sum
Sets with smallest discrepancy
Pattern: 2D Grid
Longest ascending route
Largest square area
Destination path count
Largest plus of 1’s
Pattern: Prefix sum
K limited submatrix sum
Maximum submatrix sum
Design a range sum finder
Practice
Covering distance
Reachability check
Longest bitonic subsequence
Longest alternating subsequence
Pattern as subsequence
Shortest common supersequence
Longest repeated subsequence
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
Liking the course? Check our
discounted
plans to continue learning.
Subscribe