├── DAY-01 └── 0-1 Knapsack Recursion.cpp ├── DAY-02 ├── 0-1 Knapsack Memoisation.cpp └── 0-1_Knapsack_Problem_(GEEKSFORGEEKS).cpp ├── DAY-03 ├── KNAPSACK-The_Knapsack_Problem(SPOJ).cpp └── Knapsack Problem Bottom-Up.cpp ├── DAY-04 ├── PARTY-Party_Schedule(SPOJ).cpp ├── Partition_Equal_Subset_Sum(LEETCODE).cpp ├── Subset Sum.cpp └── Subset_Sum_Problem(GEEKSFORGEEKS).cpp ├── DAY-05 ├── Count of Subsets With SUM.cpp └── Perfect_Sum_Problem(GEEKSFORGEEKS).cpp ├── DAY-06 ├── Minimum_sum_partition(GEEKSFORGEEKS).cpp └── Subset Sum.cpp ├── DAY-07 ├── Minimum_Difference_Subsets!(INTERVIEWBIT).cpp ├── Target_Sum(LEETCODE).cpp └── count subsets with given difference.cpp ├── DAY-08 ├── Knapsack(HACKERRANK).cpp ├── Knapsack_with_Duplicate_Items(GEEKSFORGEEKS).cpp └── Unbounded Knapsack.cpp ├── DAY-09 ├── Reach_a_given_score(GEEKSFORGEEKS).cpp └── Rod_Cutting(GEEKSFORGEEKS).cpp ├── DAY-10 ├── Coin_Change(GEEKSFORGEEKS).cpp ├── Coin_Change_2(LEETCODE).cpp └── The_Coin_Change_Problem(HACKERRANK).cpp ├── DAY-11 ├── Coin_Change(LEETCODE).cpp ├── Maximize_The_Cut_Segments(GEEKSFORGEEKS).cpp └── Number_of_Coins(GEEKSFORGEEKS).cpp ├── DAY-12 └── Longest Common Subsequence(Recursive).cpp ├── DAY-13 ├── Longest Common Subsequence(Memoisation).cpp └── Longest_Common_Subsequence(GEEKSFORGEEKS).cpp ├── DAY-14 ├── Longest Common Subsequence(Top-Down Approach).cpp └── Longest_Common_Subsequence(LEETCODE).cpp ├── DAY-15 ├── Longest Common Substring.cpp ├── Longest_Common_Substring(GEEKSFORGEEKS).cpp └── Maximum_Length_of_Repeated_Subarray(LEETCODE).cpp ├── DAY-16 ├── Printing Longest Common Subsequence.cpp └── The_Longest_Common_Subsequence(HACKERRANK).cpp ├── DAY-17 ├── Shortest Common Supersequence.cpp └── Shortest_Common_Supersequence(GEEKSFORGEEKS).cpp ├── DAY-18 └── Minimum_number_of_deletions_and_insertions(GEEKSFORGEEKS).cpp ├── DAY-19 ├── Longest_Palindromic_Subsequence(GEEKSFORGEEKS).cpp ├── Longest_Palindromic_Subsequence(INTERVIEWBIT).cpp └── Longest_Palindromic_Subsequence(LEETCODE).cpp ├── DAY-20 └── Minimum_Deletions(GEEKSFORGEEKS).cpp ├── DAY-21 └── Shortest_Common_Supersequence(LEETCODE).cpp ├── DAY-22 ├── Longest_Repeating_Subsequence(GEEKSFORGEEKS).cpp └── Repeating_Sub-Sequence(INTERVIEWBIT).cpp ├── DAY-23 └── Subsequence Matching.cpp ├── DAY-24 ├── Form_a_palindrome(GEEKSFORGEEKS).cpp ├── Minimum_Insertion_Steps_to_Make_a_String_Palindrome(LEETCODE).cpp └── Palindrome_2000(SPOJ).cpp ├── DAY-25 └── Matrix Chain Multiplication(Recursive).cpp ├── DAY-26 └── Matrix Chain Multiplication(Memoisation).cpp └── README.md /DAY-01/0-1 Knapsack Recursion.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-01/0-1 Knapsack Recursion.cpp -------------------------------------------------------------------------------- /DAY-02/0-1 Knapsack Memoisation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-02/0-1 Knapsack Memoisation.cpp -------------------------------------------------------------------------------- /DAY-02/0-1_Knapsack_Problem_(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-02/0-1_Knapsack_Problem_(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-03/KNAPSACK-The_Knapsack_Problem(SPOJ).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-03/KNAPSACK-The_Knapsack_Problem(SPOJ).cpp -------------------------------------------------------------------------------- /DAY-03/Knapsack Problem Bottom-Up.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-03/Knapsack Problem Bottom-Up.cpp -------------------------------------------------------------------------------- /DAY-04/PARTY-Party_Schedule(SPOJ).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-04/PARTY-Party_Schedule(SPOJ).cpp -------------------------------------------------------------------------------- /DAY-04/Partition_Equal_Subset_Sum(LEETCODE).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-04/Partition_Equal_Subset_Sum(LEETCODE).cpp -------------------------------------------------------------------------------- /DAY-04/Subset Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-04/Subset Sum.cpp -------------------------------------------------------------------------------- /DAY-04/Subset_Sum_Problem(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-04/Subset_Sum_Problem(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-05/Count of Subsets With SUM.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-05/Count of Subsets With SUM.cpp -------------------------------------------------------------------------------- /DAY-05/Perfect_Sum_Problem(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-05/Perfect_Sum_Problem(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-06/Minimum_sum_partition(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-06/Minimum_sum_partition(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-06/Subset Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-06/Subset Sum.cpp -------------------------------------------------------------------------------- /DAY-07/Minimum_Difference_Subsets!(INTERVIEWBIT).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-07/Minimum_Difference_Subsets!(INTERVIEWBIT).cpp -------------------------------------------------------------------------------- /DAY-07/Target_Sum(LEETCODE).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-07/Target_Sum(LEETCODE).cpp -------------------------------------------------------------------------------- /DAY-07/count subsets with given difference.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-07/count subsets with given difference.cpp -------------------------------------------------------------------------------- /DAY-08/Knapsack(HACKERRANK).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-08/Knapsack(HACKERRANK).cpp -------------------------------------------------------------------------------- /DAY-08/Knapsack_with_Duplicate_Items(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-08/Knapsack_with_Duplicate_Items(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-08/Unbounded Knapsack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-08/Unbounded Knapsack.cpp -------------------------------------------------------------------------------- /DAY-09/Reach_a_given_score(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-09/Reach_a_given_score(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-09/Rod_Cutting(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-09/Rod_Cutting(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-10/Coin_Change(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-10/Coin_Change(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-10/Coin_Change_2(LEETCODE).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-10/Coin_Change_2(LEETCODE).cpp -------------------------------------------------------------------------------- /DAY-10/The_Coin_Change_Problem(HACKERRANK).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-10/The_Coin_Change_Problem(HACKERRANK).cpp -------------------------------------------------------------------------------- /DAY-11/Coin_Change(LEETCODE).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-11/Coin_Change(LEETCODE).cpp -------------------------------------------------------------------------------- /DAY-11/Maximize_The_Cut_Segments(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-11/Maximize_The_Cut_Segments(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-11/Number_of_Coins(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-11/Number_of_Coins(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-12/Longest Common Subsequence(Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-12/Longest Common Subsequence(Recursive).cpp -------------------------------------------------------------------------------- /DAY-13/Longest Common Subsequence(Memoisation).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-13/Longest Common Subsequence(Memoisation).cpp -------------------------------------------------------------------------------- /DAY-13/Longest_Common_Subsequence(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-13/Longest_Common_Subsequence(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-14/Longest Common Subsequence(Top-Down Approach).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-14/Longest Common Subsequence(Top-Down Approach).cpp -------------------------------------------------------------------------------- /DAY-14/Longest_Common_Subsequence(LEETCODE).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-14/Longest_Common_Subsequence(LEETCODE).cpp -------------------------------------------------------------------------------- /DAY-15/Longest Common Substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-15/Longest Common Substring.cpp -------------------------------------------------------------------------------- /DAY-15/Longest_Common_Substring(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-15/Longest_Common_Substring(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-15/Maximum_Length_of_Repeated_Subarray(LEETCODE).cpp: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /DAY-16/Printing Longest Common Subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-16/Printing Longest Common Subsequence.cpp -------------------------------------------------------------------------------- /DAY-16/The_Longest_Common_Subsequence(HACKERRANK).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-16/The_Longest_Common_Subsequence(HACKERRANK).cpp -------------------------------------------------------------------------------- /DAY-17/Shortest Common Supersequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-17/Shortest Common Supersequence.cpp -------------------------------------------------------------------------------- /DAY-17/Shortest_Common_Supersequence(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-17/Shortest_Common_Supersequence(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-18/Minimum_number_of_deletions_and_insertions(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-18/Minimum_number_of_deletions_and_insertions(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-19/Longest_Palindromic_Subsequence(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-19/Longest_Palindromic_Subsequence(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-19/Longest_Palindromic_Subsequence(INTERVIEWBIT).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-19/Longest_Palindromic_Subsequence(INTERVIEWBIT).cpp -------------------------------------------------------------------------------- /DAY-19/Longest_Palindromic_Subsequence(LEETCODE).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-19/Longest_Palindromic_Subsequence(LEETCODE).cpp -------------------------------------------------------------------------------- /DAY-20/Minimum_Deletions(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-20/Minimum_Deletions(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-21/Shortest_Common_Supersequence(LEETCODE).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-21/Shortest_Common_Supersequence(LEETCODE).cpp -------------------------------------------------------------------------------- /DAY-22/Longest_Repeating_Subsequence(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-22/Longest_Repeating_Subsequence(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-22/Repeating_Sub-Sequence(INTERVIEWBIT).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-22/Repeating_Sub-Sequence(INTERVIEWBIT).cpp -------------------------------------------------------------------------------- /DAY-23/Subsequence Matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-23/Subsequence Matching.cpp -------------------------------------------------------------------------------- /DAY-24/Form_a_palindrome(GEEKSFORGEEKS).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-24/Form_a_palindrome(GEEKSFORGEEKS).cpp -------------------------------------------------------------------------------- /DAY-24/Minimum_Insertion_Steps_to_Make_a_String_Palindrome(LEETCODE).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-24/Minimum_Insertion_Steps_to_Make_a_String_Palindrome(LEETCODE).cpp -------------------------------------------------------------------------------- /DAY-24/Palindrome_2000(SPOJ).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-24/Palindrome_2000(SPOJ).cpp -------------------------------------------------------------------------------- /DAY-25/Matrix Chain Multiplication(Recursive).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-25/Matrix Chain Multiplication(Recursive).cpp -------------------------------------------------------------------------------- /DAY-26/Matrix Chain Multiplication(Memoisation).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/DAY-26/Matrix Chain Multiplication(Memoisation).cpp -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kothariji/30-days-of-Dynamic-Programming/HEAD/README.md --------------------------------------------------------------------------------