Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Top 50 Dynamic Programming Coding Problems for Interviews

  • Last Updated : 07 Sep, 2021

Here is the collection of the Top 50 list of frequently asked interviews question on Dynamic Programming. Problems in this Article are divided into three Levels so that readers can practice according to the difficulty level step by step.

Top-50-Dynamic-Programming-Coding-Problems-for-Interviews

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Level 1

  1. Nth Catalan Number
  2. Minimum Operations
  3. Minimum steps to delete a string after repeated deletion of palindrome substrings
  4. Minimum number of Coins
  5. Maximal Product when Cutting Rope
  6. Ways to Cover a Distance
  7. Minimum number of deletions and insertions to transform one string into another
  8. Minimum sum subsequence such that at least one of every four consecutive elements is picked

Level 2

  1. Subset Sum Problem
  2. Longest Common Subsequence
  3. Longest Increasing Subsequence
  4. Edit Distance
  5. Longest Path In Matrix
  6. Optimal Strategy for a Game
  7. 0-1 Knapsack Problem
  8. Shortest Common Supersequence
  9. Partition problem
  10. Rod Cutting
  11. Coin change problem
  12. Word Break Problem
  13. Dice Throw Problem
  14. Box Stacking
  15. Egg Dropping Puzzle
  16. Max length chain
  17. Longest Common Substring
  18. Interleaved strings
  19. Maximum sum increasing subsequence
  20. Minimum number of jumps
  21. Count subsequences of type a^i, b^j, c^k
  22. Get Minimum Squares
  23. Nth Fibonacci Number
  24. Longest Palindromic Substring
  25. Total Decoding Messages
  26. Unique BST’s
  27. Player with max score
  28. Form a palindrome
  29. Word Wrap Problem
  30. Count Palindromic Subsequences
  31. Minimum time to finish tasks without skipping two consecutive

Level 3

  1. Minimum Partition
  2. Boolean Parenthesization Problem
  3. Matrix Chain Multiplication
  4. Longest Zig-Zag Sub Sequence
  5. Maximum Profit
  6. Minimum Cost Path
  7. The painter’s partition problem
  8. Palindrome Partitioning
  9. Array Partition
  10. Maximum difference of zeros and ones in binary string
  11. Count digit groupings of a number

Related Articles:

Top 50 Array Coding Problems for Interviews

Top 50 String Coding Problems for Interviews

Top 50 Tree Coding Problems for Interviews

My Personal Notes arrow_drop_up
Recommended Articles
Page :