GitHub - HarshSahuH/Aditya-Verma-DP: Dynamic Programming

Here in this Repo/file I am Going to upload all code of Dynammic programming, Based on Aditya Verma DP playlist which is on youtube.

Created By - HARSH SAHU

(1)= Intro

(2)= knapsack Intro

(3-12)= 0-1knapsack

(13-17)= Unbounded knapsack

(18-25)= Longest Common Subsequence types

(26-32)= Longest Palindromic Subsequence types [part of LCS]

(33-45)= Matrix Chain Multiplication

(46-50)=Binary Tree regarding DP

Name		Name	Last commit message	Last commit date
Latest commit History 47 Commits
01 KnapSack Recursive.cpp		01 KnapSack Recursive.cpp
13 Unbounded Knapsack.cpp		13 Unbounded Knapsack.cpp
14 Rod Cutting.cpp		14 Rod Cutting.cpp
15 Coin Change.cpp		15 Coin Change.cpp
21 longest common subsequence LCS.cpp		21 longest common subsequence LCS.cpp
22 longest common substring.cpp		22 longest common substring.cpp
23 Print LCS Longest Common Subsequence.cpp		23 Print LCS Longest Common Subsequence.cpp
24 Shortest Common Supersequence.cpp		24 Shortest Common Supersequence.cpp
25 min no. of insertion and deletion.cpp		25 min no. of insertion and deletion.cpp
26 longest palindrome subsequence.cpp		26 longest palindrome subsequence.cpp
28 min no. of deletion to make it palindrome.cpp		28 min no. of deletion to make it palindrome.cpp
29 Print SCS.cpp		29 Print SCS.cpp
31 Is Subsequence.cpp		31 Is Subsequence.cpp
32 min insertion for Palindrome.cpp		32 min insertion for Palindrome.cpp
35 MCM BottomUP.cpp		35 MCM BottomUP.cpp
43 Egg Dropping Puzzle.cpp		43 Egg Dropping Puzzle.cpp
48 Diameter of a Binary Tree.cpp		48 Diameter of a Binary Tree.cpp
49 Maximum path sum from any node.cpp		49 Maximum path sum from any node.cpp
Minimum sum partition		Minimum sum partition
Number of Coins		Number of Coins
README.md		README.md
RainWaterTrapping.cpp		RainWaterTrapping.cpp

HarshSahuH/Aditya-Verma-DP