Following are the top Dynamic Programming Interview Questions:

**0-1 Knapsack Problem****Travelling Salesman Problem (TSP)****Word Break Problem (With Solution)****Coin Change Problem****Edit Distance Problem****Friends Pairing Problem****Subset Sum Problem****Minimum Number of Jumps****Longest Increasing Subsequence****Painters Partition Problem****Longest Common Subsequence****Climbing Stairs Problem****Maximum Subarray Sum: Kadane’s Algorithm****Longest Common Substring****Longest Palindromic Substring**