Aditya-Verma-Dynamic-Programming

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

Show some ❤️ by starring this repository! It will push me to give more percentage of efforts

0/1 Knapsack

Sr	Problems	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	✅

Unbounded Knapsack

Sr	Problems	Status
10	Unbounded Knapsack	✅
11	Rod Cutting	✅
12	Rod Cutting Gfg Problem	✅
13	Coin Change Max Ways	✅
14	Coin Change Min Coins	✅

Longest Common Subsequence (LCS)

Sr	Problems	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	✅

Matrix Chain Multiplication (MCM)

Sr	Problems	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	✅

DP on Trees

Sr	Problems	Status
43	Diameter of Binary Tree	✅
44	Maximum Path Sum	✅
45	Maximum Path Sum_leaf node	✅

Name		Name	Last commit message	Last commit date
01_Recursive_Knapsack.cpp		01_Recursive_Knapsack.cpp
02_Knapsack_memoization.cpp		02_Knapsack_memoization.cpp
03_Knapsack_BottomUp.cpp		03_Knapsack_BottomUp.cpp
04_SubsetSum.cpp		04_SubsetSum.cpp
05_EqualSumPartition.cpp		05_EqualSumPartition.cpp
06_CountOfSubset_with_given_sum.cpp		06_CountOfSubset_with_given_sum.cpp
07_Minimum_subset_sum_difference.cpp		07_Minimum_subset_sum_difference.cpp
08_CountOfSubset_with_given_difference.cpp		08_CountOfSubset_with_given_difference.cpp
09_TargetSum.cpp		09_TargetSum.cpp
10_unbounded_knapsack.cpp		10_unbounded_knapsack.cpp
11_RodCutting.cpp		11_RodCutting.cpp
12_RodCutting_Gfg_problem.cpp		12_RodCutting_Gfg_problem.cpp
13_CoinChange_maxWays.cpp		13_CoinChange_maxWays.cpp
14_CoinChange_minCoins.cpp		14_CoinChange_minCoins.cpp
15_LCS_Recursive.cpp		15_LCS_Recursive.cpp
16_LCS_memoization.cpp		16_LCS_memoization.cpp
17_LCS_Tabulation.cpp		17_LCS_Tabulation.cpp
18_LCS_LeetCode.cpp		18_LCS_LeetCode.cpp
19_Longest_Common_Substring.cpp		19_Longest_Common_Substring.cpp
20_Printing_LCS.cpp		20_Printing_LCS.cpp
21_Shortest_Common_Supersequence.cpp		21_Shortest_Common_Supersequence.cpp
22_Min_InsertDelete_to_convert_AtoB.cpp		22_Min_InsertDelete_to_convert_AtoB.cpp
23_Longest_Palindromic_Subsequence.cpp		23_Longest_Palindromic_Subsequence.cpp
24_MinDeletion_toMakeString_Palindrome.cpp		24_MinDeletion_toMakeString_Palindrome.cpp
25_Print_shortestCommonSubsequence.cpp		25_Print_shortestCommonSubsequence.cpp
26_Longest_Repeating_Subsequence.cpp		26_Longest_Repeating_Subsequence.cpp
27_Sequence_Pattern_matching.cpp		27_Sequence_Pattern_matching.cpp
28_MinInsertion_toMakeString_palindrome.cpp		28_MinInsertion_toMakeString_palindrome.cpp
29_MCM_Recursive.cpp		29_MCM_Recursive.cpp
30_MCM_Memoization.cpp		30_MCM_Memoization.cpp
31_MCM_Leetcode.cpp		31_MCM_Leetcode.cpp
32_Palindrome_Partitioning_Recursive.cpp		32_Palindrome_Partitioning_Recursive.cpp
33_Palindrome_Partitioning_memoization.cpp		33_Palindrome_Partitioning_memoization.cpp
34_Palindrome_partitioning_memoization_optimization.cpp		34_Palindrome_partitioning_memoization_optimization.cpp
35_Evaluate_expressionsToTrue_recursion.cpp		35_Evaluate_expressionsToTrue_recursion.cpp
36_Evaluate_expressionToTrue_memoization_using3dMatrix.cpp		36_Evaluate_expressionToTrue_memoization_using3dMatrix.cpp
37_Evaluate_expressionToTrue_memoization_usingMap.cpp		37_Evaluate_expressionToTrue_memoization_usingMap.cpp
38_ScrambleString_recursion.cpp		38_ScrambleString_recursion.cpp
39_ScrambleString_memoization.cpp		39_ScrambleString_memoization.cpp
40_EggDropping_recursive.cpp		40_EggDropping_recursive.cpp
41_EggDropping_memoization.cpp		41_EggDropping_memoization.cpp
42_EggDropping_memoization_BinarySearch.cpp		42_EggDropping_memoization_BinarySearch.cpp
43_Diameter_of_BinaryTree.cpp		43_Diameter_of_BinaryTree.cpp
44_MaxPathSum.cpp		44_MaxPathSum.cpp
45_MaxPathSum_leafnode.cpp		45_MaxPathSum_leafnode.cpp
README.md		README.md

Navigation Menu

Repository files navigation

Aditya-Verma-Dynamic-Programming

Show some ❤️ by starring this repository! It will push me to give more percentage of efforts

0/1 Knapsack

Unbounded Knapsack

Longest Common Subsequence (LCS)

Matrix Chain Multiplication (MCM)

DP on Trees

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

Aditya-Verma-Dynamic-Programming

Show some ❤️ by starring this repository! It will push me to give more percentage of efforts

0/1 Knapsack

Unbounded Knapsack

Longest Common Subsequence (LCS)

Matrix Chain Multiplication (MCM)

DP on Trees

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages