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.

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
21. Count distinct occurrences as a subsequence
22. Word Break - Find All Ways to Break
23. String Interleaving
24. Max Skill
25. Buy and Sell Stock with Transaction Fee
26. Palindrome Partitioning

Related Articles

• DSA Tutorial
• System Design Tutorial
• GfG 160