Skip to content
/ DP Public

C++ solution of DP series by Aditya Verma playlist available on youtube

2 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

SAMRIDHISAINII/DP

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

98 Commits
01 knapsack problem recusive.cpp
01 knapsack problem recusive.cpp
 
 
02Knapsackmemoization.cpp
02Knapsackmemoization.cpp
 
 
03 Knapsack problem. bottom up.cpp
03 Knapsack problem. bottom up.cpp
 
 
04 subset sum(knapsack variation).cpp
04 subset sum(knapsack variation).cpp
 
 
05 Equal-Sum-Partition.cpp
05 Equal-Sum-Partition.cpp
 
 
06 countofsubsetsum_witha givensum.cpp
06 countofsubsetsum_witha givensum.cpp
 
 
07 Minimum subset sum difference.cpp
07 Minimum subset sum difference.cpp
 
 
08 Count the number of subset with given difference.cpp
08 Count the number of subset with given difference.cpp
 
 
09 target sum .cpp
09 target sum .cpp
 
 
10 Unbounded Knapsack.cpp
10 Unbounded Knapsack.cpp
 
 
11 Rod cutting problem.cpp
11 Rod cutting problem.cpp
 
 
12 Coin change problem _ maximum no of ways.cpp
12 Coin change problem _ maximum no of ways.cpp
 
 
13 Coin change problem_ Minimum number of coin.cpp
13 Coin change problem_ Minimum number of coin.cpp
 
 
14 Longest Common Subsequence.cpp
14 Longest Common Subsequence.cpp
 
 
15 longest common subsequence top down memoization.cpp
15 longest common subsequence top down memoization.cpp
 
 
16 longest commons subsequnce bottom up dp.cpp
16 longest commons subsequnce bottom up dp.cpp
 
 
17 lcs substring .cpp
17 lcs substring .cpp
 
 
18 printlcs.cpp
18 printlcs.cpp
 
 
19 Shortest Common Supersequence.CPP
19 Shortest Common Supersequence.CPP
 
 
20 Minimum insertion deletion to convert a to b.cpp
20 Minimum insertion deletion to convert a to b.cpp
 
 
21 Longest Palindromic Subsequence.cpp
21 Longest Palindromic Subsequence.cpp
 
 
22 Minimum number of deletions to make a string.cpp
22 Minimum number of deletions to make a string.cpp
 
 
23 Print Shortest Common Supersequence.cpp
23 Print Shortest Common Supersequence.cpp
 
 
24 Longest repeating subsequence.cpp
24 Longest repeating subsequence.cpp
 
 
25 Sequence pattern matching.cpp
25 Sequence pattern matching.cpp
 
 
26 Minimum Number of insertion to make a string palindrome.cpp
26 Minimum Number of insertion to make a string palindrome.cpp
 
 
27 matrix chain.cpp
27 matrix chain.cpp
 
 
README.md
README.md
 
 

Repository files navigation

Aditya-verma-youtube-playlist-CPP_code

C++ solution of DP series by Aditya Verma playlist available on youtube

This explains the the concept in a very understanding way and it explains how to approch the problems of dp ,how to identify it and when to use which method

About

C++ solution of DP series by Aditya Verma playlist available on youtube

Topics

youtube cpp dp aditya-verma-dp

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages