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.

**Maximum Sum Sub array (KADANE’S Algorithm)****Rod Cutting Problem****Longest Common Substring****Longest Common Subsequence****Longest Palindromic Subsequence****Pots of Gold****0-1 Knapsack Problem****Subset Sum Problem****Equal Sum Partition****Coin change Problem****Minimum Edit Distance****House Robber****Maximum size square sub-matrix****Minimum Path Sum****Longest Increasing Sub-Sequence****Activity Selection Problem****Number of ways to reach N’th Stair****Egg Dropping Puzzle****K-Palindromic String****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