Top 20 Dynamic Programming Interview Questions

Here is a curated list of top 20 Dynamic Programming questions that are mostly asked in online coding rounds, face to face technical interviews and competitive coding contests. This list contains a wide variety of problems collected from various sources including Leetcode, Codeforces, Codechef and other programming platforms. These are the most asked questions on Dynamic Programming and are sufficient to provide an in-depth knowledge on Dynamic Programming. Each problem has an in-depth explanation alongwith the algorithm, sample test cases and the code.

  1. Maximum Sum Sub array (KADANE’S Algorithm)
  2. Rod Cutting Problem
  3. Longest Common Substring
  4. Longest Common Subsequence
  5. Longest Palindromic Subsequence
  6. Pots of Gold
  7. 0-1 Knapsack Problem
  8. Subset Sum Problem
  9. Equal Sum Partition
  10. Coin change Problem
  11. Minimum Edit Distance
  12. House Robber
  13. Maximum size square sub-matrix
  14. Minimum Path Sum
  15. Longest Increasing Sub-Sequence
  16. Activity Selection Problem
  17. Number of ways to reach N’th Stair
  18. Egg Dropping Puzzle
  19. K-Palindromic String
  20. Minimum number of coins

We hope that this set of questions would surely help you get rid of the fear of Dynamic Programming. We promise to bring you similar sets of questions on various other topics in the near future.

One comment

Leave a Reply

Your email address will not be published.