Top 20 Dynamic Programming Interview Questions

Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems and stores the results of subproblems to avoid computing the same results again. Following are the most important Dynamic Programming problems asked in various Technical Interviews.


  1. Longest Common Subsequence
  2. Longest Increasing Subsequence
  3. Edit Distance
  4. Minimum Partition
  5. Ways to Cover a Distance
  6. Longest Path In Matrix
  7. Subset Sum Problem
  8. Optimal Strategy for a Game
  9. 0-1 Knapsack Problem
  10. Boolean Parenthesization Problem
  11. Shortest Common Supersequence
  12. Matrix Chain Multiplication
  13. Partition problem
  14. Rod Cutting
  15. Coin change problem
  16. Word Break Problem
  17. Maximal Product when Cutting Rope
  18. Dice Throw Problem
  19. Box Stacking
  20. Egg Dropping Puzzle

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.

My Personal Notes arrow_drop_up

Improved By : aryavijay