Skip to content

Latest commit

 

History

History

Dynamic Programming

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
01 Recursive Knapsack.cpp
01 Recursive Knapsack.cpp
 
 
02 Knapsack Memoization(DP).cpp
02 Knapsack Memoization(DP).cpp
 
 
03 Knapsack Bottom up.cpp
03 Knapsack 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 Count of Subsets with given Sum.cpp
06 Count of Subsets with given Sum.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 recursive.cpp
14 Longest Common Subsequence recursive.cpp
 
 
15 Longest Common Subsequence Top down(Memoization).cpp
15 Longest Common Subsequence Top down(Memoization).cpp
 
 
16 Longest Common Subsequence Bottom Up(DP).cpp
16 Longest Common Subsequence Bottom Up(DP).cpp
 
 
17 LCS Substring.cpp
17 LCS Substring.cpp
 
 
18 Print LCS.cpp
18 Print LCS.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 palindrome.cpp
22 Minimum number of deletions to make a string palindrome.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 multiplication.cpp
27 Matrix chain multiplication.cpp
 
 
28 MCM Memoization.cpp
28 MCM Memoization.cpp
 
 
29 Palindrome Partitioning Recursive.cpp
29 Palindrome Partitioning Recursive.cpp
 
 
30 Palindrome Partitioning Memoization.cpp
30 Palindrome Partitioning Memoization.cpp
 
 
31 Palindrome Partitioning Memoized optimization.cpp
31 Palindrome Partitioning Memoized optimization.cpp
 
 
32 Evaluate Expression to true Recursive.cpp
32 Evaluate Expression to true Recursive.cpp
 
 
33 Evaluate expression to true memoization using map.cpp
33 Evaluate expression to true memoization using map.cpp
 
 
34 Evaluate expression to true memoization using 3d array.cpp
34 Evaluate expression to true memoization using 3d array.cpp
 
 
35 Scramble string recursive.cpp
35 Scramble string recursive.cpp
 
 
36 Scramble string top down.cpp
36 Scramble string top down.cpp
 
 
37 Egg dropping problem recursive.cpp
37 Egg dropping problem recursive.cpp
 
 
38 Egg dropping problem top down.cpp
38 Egg dropping problem top down.cpp
 
 
39 Egg dropping problem memoization optimization.cpp
39 Egg dropping problem memoization optimization.cpp
 
 
40 Diameter of binary tree.cpp
40 Diameter of binary tree.cpp
 
 
41 Max path sum from any node to any.cpp
41 Max path sum from any node to any.cpp
 
 
42 Max_path_sum_from_leaf_to_leaf.cpp
42 Max_path_sum_from_leaf_to_leaf.cpp
 
 
readme.md
readme.md
 
 

readme.md