Dynamic Programming
In this section we will see problems based on Dynamic Programming, such as Longest Common Subsequence Problem, The Levenshtein distance (Edit distance) Problem, Matrix Chain, Multiplication Problem, 0–1 Knapsack Problem, Partition Problem & Rod Cutting Problem.