Home » Interview coding problems

Dynamic programming practice problems with solutions

Dynamic programming practice problems: Here, you will find the various dynamic programming practice problems with solutions that are commonly asked in the various interview rounds of the companies. Each dynamic programming practice problem has its solution with the examples, detailed explanations of the solution approaches.

List of the dynamic programming practice problems

1. 0-1 Knapsack Algorithm
2. House Robber
3. Coin Change
4. Minimum Coin Change | Find minimum number of coins that make a given value
5. Word Break Problem
6. Friends pairing problem
7. Maximum Profit in Stock Buy and sell with at most K Transaction
8. Floyd Warshall Algorithm
9. Optimal Strategy for a Game
10. Highway billboard
11. Gold Mine Problem
12. Longest Increasing Subsequence
13. Minimum Number of coins to make the change
14. Get Minimum Squares
15. Count Numbers with unique digits
16. Maximum Sum Problem
17. Find number of times a string occurs as a subsequence
18. Number of Unique Paths
19. Minimum number of jumps
20. Rod Cutting
21. Dice throw
22. Longest Common Subsequence
23. Longest Repeating Subsequence
24. Length of the Longest Bitonic Subsequence
25. Print the Longest Bitonic Subsequence
26. Find out the longest palindromic subsequence from a string
27. Find out the length of the longest palindromic subsequence from a string
28. Count the number of palindromic subsequences in a given string
29. Subset Sum
30. Equal Sum partition
31. Maximize the cut segments
32. Pizza Mania Problem
33. Letter/Blog Writer Coding Problem (using Dynamic Programming)
34. Largest zigzag sequence
35. Number of ways to construct the grid
36. Minimum number of deletions to make a string palindrome
37. Minimum Cost to Make Two Strings Identical
38. Shortest Common Super Sequence
39. Printing Longest Common Subsequence
40. Wine selling problem | Find the maximum profit from sale of wines
41. Egg Dropping Problem
42. Probability of getting more number of heads than tails if coins are tossed
43. Minimum Path Sum
44. Maximum path sum in a binary tree
45. Minimum number of deletions to make a sorted sequence
46. Jumbled Strings
47. Count of divisible array
48. Maximum Calorie
49. Special Keyboard
50. Minimal moves to form a string
51. Total number of non-decreasing numbers with n digits using dynamic programming
52. Minimum Time to Display N Character
53. Sum of all substrings of a number
54. Count of Subarrays
55. Knapsack with Duplicate Items
56. Longest Common Subsequence of three strings
57. Minimum steps to minimize n as per given condition
58. Count total number of Palindromic Subsequences
59. Minimum cost to fill given weight in a bag
60. Adjacent are not allowed
61. Count number of binary strings without consecutive 1's
62. Longest Palindromic Substring
63. Count total number of Palindromic Substrings
64. Find the maximum sum alternating subsequence
65. High-effort vs. Low-effort Task Problem
66. Largest Independent Set Problem
67. Longest alternating subsequence
68. Print the longest alternating subsequence
69. Step count problem | Find the number of possible combinations to reach the final step
70. Print Maximum Length Chain of Pairs
71. Longest Increasing Odd Even Subsequence
72. Island Probability
73. Activity Selection Problem
74. Weighted Job Scheduling
75. K-Palindromic String
76. Find Total Ways to Reach Nth Stair from Bottom
77. Mobile Keypad Problem
78. Box Stacking Problem
79. Maximization of Quadruple
80. Path in Matrix
81. Maximum Product Cutting
82. Maximum Sum Increasing Subsequence
83. Largest Square Sub Matrix of 1's in Given Binary Matrix
84. Count Total Possible Path with Given Sum
85. Perfect Sum Problem
86. Subset Sum Problem
87. Minimum Sum Partition