S. No | Type | No. of variations |
---|---|---|
1 | 0-1 Knapsack | 6 |
2 | Unbounded Knapsack | 5 |
3 | Fibonacci | 7 |
4 | Longest Common Subsequence | 15 |
5 | Longest Increasing Subsequence | 10 |
6 | Kadane's algorithm | 6 |
7 | Matrix Chain Multiplication | 7 |
8 | DP on Trees | 4 |
9 | DP on Graphs | 14 |
10 | Others | 5 |
gallatarun / dynamic-programming Goto Github PK
View Code? Open in Web Editor NEWDynamic programming problem variations