DP-Interviews
  • Dynamic Programming
  • Notes
    • Equal Subset Sum Partition
    • Longest Increasing Subsequence
    • Maximum Ribbon Cut
    • Largest Divisible Subset
    • Longest Common Substring
    • Unbounded Knapsack
    • Minimum Coin Change
    • Coin Change
    • Target Sum
    • Minimum Subset Sum Difference
    • Rod Cutting
    • Longest Palindromic Substring
    • Longest Bitonic Sequence
    • Longest Repeating Sequence
    • Longest String Chain
    • Natarajan's Birthday Bombs
    • Subsequence Pattern Matching
    • Russian Doll
    • Buy & Sell Stock
    • Maximum Sum Increasing Subsequence
    • Longest Common Subsequence
    • Shortest Common Supersequence
    • 0/1 Knapsack Problem
    • Best Team With No Conflict
    • Count Subset Sum
    • Edit Distance
    • Box-Stacking
    • Longest Palindromic Subsequence
    • All Possible Cuts In All Possible Intervals For Choosing Last Operation
    • Minimum Deletions & Insertions To Transform a String into another
    • Regular Expression Matching
    • Wildcard Matching
    • Optimal Paths To Target
Powered by GitBook
On this page

Was this helpful?

Notes

Equal Subset Sum PartitionLongest Increasing SubsequenceMaximum Ribbon CutLargest Divisible SubsetLongest Common SubstringUnbounded KnapsackMinimum Coin ChangeCoin ChangeTarget SumMinimum Subset Sum DifferenceRod CuttingLongest Palindromic SubstringLongest Bitonic SequenceLongest Repeating SequenceLongest String ChainNatarajan's Birthday BombsSubsequence Pattern MatchingRussian DollBuy & Sell StockMaximum Sum Increasing SubsequenceLongest Common SubsequenceShortest Common Supersequence0/1 Knapsack ProblemBest Team With No ConflictCount Subset SumEdit DistanceBox-StackingLongest Palindromic SubsequenceAll Possible Cuts In All Possible Intervals For Choosing Last OperationMinimum Deletions & Insertions To Transform a String into anotherRegular Expression MatchingWildcard MatchingOptimal Paths To Target
PreviousDynamic ProgrammingNextEqual Subset Sum Partition

Last updated 4 years ago

Was this helpful?