Important Coding Interview Questions-2 (Dynamic Programming)

The questions included in part 2 of this series are based on topics such as - Recursion, memoization, Dynamic Programming - top down approach and bottom up approach, Knapsack - top down recursive solution both without and with memoization, Knapsack -bottom up Dynamic Programming iterative solution, Rod Cutting problem, Minimum number of coins for making change problem, Maximum number of ways for making change coin problem, Longest Common Subsequence - top down recursive solution both without and with memoization, Longest Common Subsequence - bottom up Dynamic Programming iterative solution, Longest Common Substring, Minimum number of insertion and deletions required to convert string A to string B.