Hey there! Struggling with dynamic programming? No sweat! In this blog, we'll tackle it step by step. I'll lay out our plan and share easy techniques and examples to help you get the hang of it. Let's ace dynamic programming together!
Dynamic Programming : It's like a cooler version of recursion. You still break big problems into smaller ones, but with dynamic programming you also have the choice to either store or reuse solutions to subproblems
| Type | Difficulty | Total variants |
|---|---|---|
| 1. Fractional KnapSack | 4/10 | 1 |
| 2. 0-1 KnapSack | 7/10 | 6 |
| 3. Unbounded KnapSack | 6/10 | 5 |
| 4. Fibonnaci Series | 2/10 | 7 |
| 5. Longest Common Subsequence | 5/10 | 15 |
| 6. Longest Increasing Subsequence | 6/10 | 10 |
| 7. Kadane's Algorithm | 4/10 | 6 |
| 8. Matrix Chain Multiplication | 8/10 | 7 |
| 9. DP on Trees | 7/10 | 4 |
| 10.DP on Grid | 6/10 | 14 |
| 11.Other | 5 |
Fractional Knapsack isn't a DP problem but rather a problem based on the Greedy Algorithm; however, it's still necessary to learn 0-1 Knapsack.
Happy Coding!