Dynamic_Programming

Dynamic Programming

Knapsack Pattern

Sr.	Problem
1	0-1 Knapsack Problem
2	Subset sum
3	Equal Sum Partition Problem
4	Count subset sum with given sum
5	Minimum subset sum difference
6	Count of subset sum with given difference
7	Unbounded Knapsack
8	Rod cutting
9	Coin Change - I
10	Coin change - II

Longest Common Subsequence Pattern

Sr.	Problem
1	Longest Common Subsequence
2	Longest Common Substring
3	Print Lcs
4	Shortest common supersequence(SCS)
5	Minimun deletion and insertion to transform the string
6	Longest palindromic subsequence
7	Minimum deletions to make strin palindrome
8	Print SCS
9	Longest Repeated Subsequence

Matrix Chain Multiplication Pattern

Sr.	Problem
1	Matrix Chain Multiplication
2	Palindromic Partitioning
3	Boolean Parenthesization
4	Scramble string
5	Egg Dropping

DP on Trees

Sr.	Problem
1	Diameter of a Binary Tree
2	Maximum path sum from any node to any node
3	Maximum path sum from leaf node to leaf node