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
State
Definition of state
Discovering the state
Recurrence relation
The Bellman optimality equation
Deriving a recurrence relation
Verifying a recurrence relation
Base cases
Defining base cases
Identifying base cases
Verifying base cases
Order of execution
Computation order
Top down order of execution
Bottom up order of execution
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
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
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
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
Bounded knapsack
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
Unbounded knapsack
Counting knapsack
Understanding the counting knapsack problem
Understanding the top-down solution to the counting knapsack problem
Understanding the bottom-up solution to the counting knapsack problem
Counting Knapsack
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
Longest palindromic substring
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
Matrix chain multiplication
Understanding the matrix chain multiplication problem
Understanding the top down solution to the matrix chain multiplication problem
Understanding the bottom up solution to the matrix chain multiplication problem
Matrix chain multiplication
Pattern: Linear DP
Understanding the linear DP pattern
Identifying the linear DP pattern
Calculate factorial
Nth fibonacci number
Covering distance
Min cost climbing stairs
Reachability check
House robber
Decode ways
Pattern: Running suffix DP
Understanding the running-suffix DP pattern
Identifying the running-suffix DP pattern
Best time to buy and sell stock
Longest run under a limit
Maximum ascending run sum
Largest contiguous sum
Maximum product subarray
Maximum sum circular subarray
Pattern: Subsequence DP
Understanding the subsequence DP pattern
Identifying the subsequence DP pattern
Largest divisible subset
Longest increasing subsequences
Largest sum ascending subsequence
Longest bitonic subsequence
Longest alternating subsequence
Pattern: Grid DP
Minimum path sum
Destination path count
Largest square area
Largest plus of 1's
Largest X of 1’s
Longest ascending route
Dungeon game
Pattern: Dual sequence DP
Understanding the dual-sequence DP pattern
Identifying the dual-sequence DP pattern
Wildcard pattern matching
Interleaving Check
Pattern as subsequence
Shortest common supersequence
Longest repeated subsequence
Pattern: 0/1 knapsack
Subset sum
Partition with equal sum
Sets with smallest discrepancy
Target sum
Pattern: Bounded knapsack
Payment with limited coins
Minimum coins with limited supply
Ways to pay with limited coins
Dice rolls with target sum
Rod cutting with limited pieces
Pattern: Unbounded knapsack
Coin change
Perfect squares
Integer break
Ribbon cut
Rod cutting
Pattern: Counting knapsack
Subset sum count
Subset difference count
Rod cutting combinations
Perfect square combinations
Integer partitions
Staircase climb count
Pattern: Palindrome DP
Understanding the palindrome DP pattern
Identifying the palindrome DP pattern
Word break
Count palindromic substrings
Minimum insertions to make a palindrome
Pattern: Interval DP
Burst balloons
Minimum cost to merge stones
Minimum cost to cut a stick
Boolean parenthesization
Optimal game strategy
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
Liking the course? Check our
discounted
plans to continue learning.
Subscribe