DP-Interviews
search
⌘Ctrlk
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
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Notes

Equal Subset Sum Partitionchevron-rightLongest Increasing Subsequencechevron-rightMaximum Ribbon Cutchevron-rightLargest Divisible Subsetchevron-rightLongest Common Substringchevron-rightUnbounded Knapsackchevron-rightMinimum Coin Changechevron-rightCoin Changechevron-rightTarget Sumchevron-rightMinimum Subset Sum Differencechevron-rightRod Cuttingchevron-rightLongest Palindromic Substringchevron-rightLongest Bitonic Sequencechevron-rightLongest Repeating Sequencechevron-rightLongest String Chainchevron-rightNatarajan's Birthday Bombschevron-rightSubsequence Pattern Matchingchevron-rightRussian Dollchevron-rightBuy & Sell Stockchevron-rightMaximum Sum Increasing Subsequencechevron-rightLongest Common Subsequencechevron-rightShortest Common Supersequencechevron-right0/1 Knapsack Problemchevron-rightBest Team With No Conflictchevron-rightCount Subset Sumchevron-rightEdit Distancechevron-rightBox-Stackingchevron-rightLongest Palindromic Subsequencechevron-rightAll Possible Cuts In All Possible Intervals For Choosing Last Operationchevron-rightMinimum Deletions & Insertions To Transform a String into anotherchevron-rightRegular Expression Matchingchevron-rightWildcard Matchingchevron-rightOptimal Paths To Targetchevron-right
PreviousDynamic Programmingchevron-leftNextEqual Subset Sum Partitionchevron-right

Last updated 4 years ago