Skip to content

Topic 19 of 21

Dynamic Programming Problems

The full DP series: 1D DP, DP on grids, subsets, strings and stocks, LIS and partition DP, from Climbing Stairs to Burst Balloons.

55 dynamic programming problems (19 medium, 36 hard) with LeetCode and GeeksforGeeks links.

Your progress

– / 55 solved

Easy
–/0
Medium
–/19
Hard
–/36
  1. Climbing StairsMediumLeetCodeGFG
  2. Frog JumpMediumLeetCodeGFG
  3. Frog Jump with K Distances (DP-4)MediumGFG
  4. Maximum Sum of Non-Adjacent Elements (DP-5)MediumLeetCodeGFG
  5. House Robber (DP-6)MediumLeetCodeGFG
  6. Ninja's Training (DP-7)MediumGFG
  7. Grid Unique Paths: DP on Grids (DP-8)MediumLeetCodeGFG
  8. Grid Unique Paths 2 (DP-9)MediumLeetCodeGFG
  9. Minimum Path Sum in Grid (DP-10)MediumLeetCodeGFG
  10. Minimum Path Sum in Triangular Grid (DP-11)MediumLeetCodeGFG
  11. Minimum/Maximum Falling Path Sum (DP-12)MediumLeetCodeGFG
  12. 3D DP: Ninja and His Friends (DP-13)MediumGFG
  13. Subset Sum Equal to Target (DP-14)MediumGFG
  14. Partition Equal Subset Sum (DP-15)MediumLeetCodeGFG
  15. Partition Set into 2 Subsets with Min Absolute Sum Diff (DP-16)MediumLeetCodeGFG
  16. Count Subsets with Sum K (DP-17)MediumGFG
  17. Count Partitions with Given Difference (DP-18)MediumGFG
  18. 0/1 Knapsack (DP-19)HardGFG
  19. Minimum Coins (DP-20)HardLeetCodeGFG
  20. Target Sum (DP-21)MediumLeetCodeGFG
  21. Coin Change 2 (DP-22)HardLeetCodeGFG
  22. Unbounded Knapsack (DP-23)HardGFG
  23. Rod Cutting Problem (DP-24)HardGFG
  24. Longest Common Subsequence (DP-25)HardLeetCodeGFG
  25. Print Longest Common Subsequence (DP-26)HardGFG
  26. Longest Common Substring (DP-27)HardGFG
  27. Longest Palindromic Subsequence (DP-28)HardLeetCodeGFG
  28. Minimum Insertions to Make String Palindrome (DP-29)HardLeetCodeGFG
  29. Minimum Insertions/Deletions to Convert String (DP-30)HardLeetCodeGFG
  30. Shortest Common Supersequence (DP-31)HardLeetCodeGFG
  31. Distinct Subsequences (DP-32)HardLeetCodeGFG
  32. Edit Distance (DP-33)HardLeetCodeGFG
  33. Wildcard Matching (DP-34)MediumLeetCodeGFG
  34. Best Time to Buy and Sell Stock (DP-35)HardLeetCodeGFG
  35. Buy and Sell Stock II (DP-36)HardLeetCode
  36. Buy and Sell Stocks III (DP-37)HardLeetCode
  37. Buy and Sell Stock IV (DP-38)HardLeetCode
  38. Buy and Sell Stocks with Cooldown (DP-39)HardLeetCodeGFG
  39. Buy and Sell Stocks with Transaction Fee (DP-40)HardLeetCodeGFG
  40. Longest Increasing Subsequence (DP-41)HardLeetCode
  41. Printing Longest Increasing Subsequence (DP-42)HardGFG
  42. Longest Increasing Subsequence (DP-43)HardLeetCodeGFG
  43. Largest Divisible Subset (DP-44)HardLeetCodeGFG
  44. Longest String Chain (DP-45)HardLeetCodeGFG
  45. Longest Bitonic Subsequence (DP-46)HardLeetCode
  46. Number of Longest Increasing Subsequences (DP-47)HardLeetCodeGFG
  47. Matrix Chain Multiplication (DP-48)HardGFG
  48. Matrix Chain Multiplication | Bottom-Up (DP-49)Hard
  49. Minimum Cost to Cut the Stick (DP-50)HardLeetCode
  50. Burst Balloons (DP-51)HardLeetCode
  51. Evaluate Boolean Expression to True (DP-52)HardLeetCodeGFG
  52. Palindrome Partitioning II (DP-53)HardLeetCodeGFG
  53. Partition Array for Maximum Sum (DP-54)HardLeetCodeGFG
  54. Maximum Rectangle Area with All 1's (DP-55)HardLeetCodeGFG
  55. Count Square Submatrices with All Ones (DP-56)HardLeetCodeGFG