- mohitsingla123/Dynamic-Programming-java: Contains the code of different DP problems. ie. 0/1 knapsack, unbounded-knapsack, Fibonacci, and different variations of similar problems.

Problem Statement	Solution
1. SubSet Sum Problem	Java Solution
2. Equal Sum Partition	Java Solution
3. Count Subset Sum	Java Solution
4. Minimum Subset Sum Problem	Java Solution
5. Count the number of subset with a given difference	Java Solution
6. Target Sum	Java Solution

Problem Statement	Solution
1. Cutting the Rod	Java Solution
2. Coin Change : Maximum number of ways	Java Solution
3. Coin Change : Minumum Number of Coin	Java Solution

Problem Statement	Solution
1. Longest Common SubSequence Using Recursive approch	Java Solution
2. Longest Common SubSequence Using Top-Down approch	Java Solution
3. Longest Common SubString	Java Solution
4. Print Longest Common SubSequence	Java Solution
5. Printing Longest Common SubString	Java Solution
6. Minimum Number of Insertion and Deletion to Convert two String	Java Solution
7. Longest Palindromic Subsequence	Java Solution

Problem Statement	Solution
1. Matrix Chain Multiplication Recursive	Java Solution

Name		Name	Last commit message	Last commit date
Latest commit History 70 Commits
0-1 knapsack		0-1 knapsack
Longest Common Subsequence		Longest Common Subsequence
Matrix Chain Multiplication (MCM)		Matrix Chain Multiplication (MCM)
Problem Statement		Problem Statement
Unbounded Knapsack		Unbounded Knapsack
LICENSE		LICENSE
README.md		README.md

Repository files navigation