Dynamic-Programming

A collection of dynamic programming solutions that can blow your mind

0-1 KNAPSACK

Sl No.	Problem Statement
1	0-1 Knapsack Problem (Recursive)
2	0-1 Knapsack Problem (Bottom Up)
3	Subset Sum
4	Equal Sum Partition
5	Count Subsets With Given Sum
6	Minimum Subset Sum Difference
7	Count Number of Subsets With Given Difference
8	Target Sum

---

UNBOUNDED KNAPSACK

Sl No.	Problem Statement
1	Unbounded Knapsack
2	Coin Change I (Max number of combinations)
3	Coin Change II (Min number of combinations)
4	Ribbon Cutting Max Product

---

LEAST COMMON SUBSEQUENCE

Sl No.	Problem Statement
1	Longest Common Subsequence (Recursive)
2	Longest Common Subsequence (Bottom-Up)
3	Longest Common Substring
4	Print Longest Common Subsequence
5	Print Longest Common Substring
6	Minimum number of Insertions and Deletions to Transform a String to Another
7	Longest Repeating Subsequence
8	Length of longest subsequence of a string which is a substring of another
9	Subsequence Pattern Matching
10	Count number of times a string appears as a subsquence in another string
11	Longest Palindrominc Subsequence
12	Longest Palindromic Substring
13	Count All Palindromic Substrings
14	Minimum Number of Deletions in a string to make it Palindrome
15	Minimum Number of Insertions in a string to make it Palindrome

MATRIX CHAIN MULTIPLICATION