This repo consists of codes of all questions covered by Aditya Verma in his Dynamic Programming Playlist.
(Codes are tested on GeeksforGeeks / LeetCode and are in the order of videos)
Note: Click on title of question to go to the page of code
Sr | Problems | TryIt | Youtube | Status |
---|---|---|---|---|
1 | Knapsack Recursion | ![]() |
✅ | |
2 | Knapsack Memoization | ![]() |
✅ | |
3 | Knapsack BottomUp | ![]() |
✅ | |
4 | Subset Sum | ![]() |
✅ | |
5 | Equal Sum Partition | ![]() |
✅ | |
6 | Count Of Subset With Given Sum | ![]() |
✅ | |
7 | Minimum Subset Sum Difference | ![]() |
✅ | |
8 | Count of Subset with Given Difference | ![]() |
✅ | |
9 | Target Sum | ![]() |
✅ |
Sr | Problems | TryIt | Youtube | Status |
---|---|---|---|---|
10 | Unbounded Knapsack | ![]() |
✅ | |
11 | Rod Cutting | ![]() |
✅ | |
12 | Rod Cutting Gfg Problem | ✅ | ||
13 | Coin Change Max Ways | ![]() |
✅ | |
14 | Coin Change Min Coins | ![]() |
✅ |
Sr | Problems | TryIt | Youtube | Status |
---|---|---|---|---|
15 | LCS Recursive | ![]() |
✅ | |
16 | LCS Memoization | ![]() |
✅ | |
17 | LCS Tabulation | ![]() |
✅ | |
18 | LCS LeetCode | ✅ | ||
19 | Longest Common Substring | ![]() |
✅ | |
20 | Printing LCS | ![]() |
✅ | |
21 | Shortest Common Supersequence | ![]() |
✅ | |
22 | Min Insert Delete to convert A to B | ![]() |
✅ | |
23 | Longest Palindromic Subsequence | ![]() |
✅ | |
24 | Min Deletion to make String Palindrome | ![]() |
✅ | |
25 | Print Shortest Common Subsequence | ![]() |
✅ | |
26 | Longest Repeating Subsequence | ![]() |
✅ | |
27 | Sequence Pattern Matching | ![]() |
✅ | |
28 | Min Insertion to make string Palindrome | ![]() |
✅ |
Sr | Problems | TryIt | Youtube | Status |
---|---|---|---|---|
29 | MCM Recursive | ![]() |
✅ | |
30 | MCM Memoization | ![]() |
✅ | |
31 | MCM Leetcode | ✅ | ||
32 | Palindrome Partitioning Recursive | ![]() |
✅ | |
33 | Palindrome Partitioning Memoization | ![]() |
✅ | |
34 | Palindrome Partitioning Memoization Optimization | ![]() |
✅ | |
35 | Evaluate Expressions to True Recursion | ![]() |
✅ | |
36 | Evaluate Expressions to True Memoization_using 3d Matrix | ![]() |
✅ | |
37 | Evaluate Expressions to True Memoization_using using Map | ![]() |
✅ | |
38 | Scramble String recursion | ![]() |
✅ | |
39 | Scramble String Memoization | ![]() |
✅ | |
40 | Egg Dropping recursive | ![]() |
✅ | |
41 | Egg Dropping memoization | ![]() |
✅ | |
42 | Egg Dropping memoization_BinarySearch | ![]() |
✅ |
Sr | Problems | TryIt | Youtube | Status |
---|---|---|---|---|
43 | Diameter of Binary Tree | ![]() |
✅ | |
44 | Maximum Path Sum | ![]() |
✅ | |
45 | Maximum Path Sum_leaf node | ![]() |
✅ |