Dynamic Programming⚡

The only DP Solutions Repo you need...

BuyMeACoffee

  • Recursion + Memoization
  • Bottom Up Tabulation
    Solutions from both methods are available!🤘 We have curated different types of DP problems in different tables and each problem has two links, the first link is Recursion + Memoization based and the second link is Bottom Up Tabulation based.

Interval Based

Problem Solution Link
Two Best Non-Overlapping Events Link
Link

Knapsack Based

Problem Solution Link
Partition Equal Subset Sum Link
Link

Longest Increasing Subsequence (LIS) Based

Problem Solution Link
Best Team with No Conflicts Link
Link
Longest Increasing Subsequence and Print Link
Link

Matrix DP

Problem Solution Link
Longest Increasing Path in Matrix Link
Link
©️ License
viscous and theiconik