Frequently Asked Dynamic Programming(DP) Interview Questions and Answers

  1. Longest Increasing Subsequence
  2. Longest Common Subsequence
  3. Edit Distance
  4. Min Cost Path
  5. Coin Change
  6. 0-1 Knapsack Problem
  7. Egg Dropping Puzzle
  8. Longest Palindromic Subsequence
  9. Cutting a Rod
  10. Maximum Sum Increasing Subsequence
  11. Longest Bitonic Subsequence
  12. Mobile Numeric Keypad Problem
  13. Word Wrap Problem
  14. Minimum number of jumps to reach end
  15. Box Stacking Problem
  16. Subset Sum Problem
  17. Maximum sum rectangle in a 2D matrix
  18. Maximum profit by buying and selling a share at most twice
  19. Count ways to reach the n’th stair
  20. Boolean Parenthesization Problem