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.
What is the O/1 knapsack problem?

What is "Subset Sum Problem" ?

Count number of subsets with given sum

Equal subset sum partition problem

Longest Common Subsequence (LCS)

Print Longest Common Subsequence (LCS)

Shortest Common Super-sequence (SCS)

Print Shortest Common Super-sequence (SCS)

Find length of the Longest Common Substring

Minimum number of deletions and insertions