|
1 | | -# Dynamic-Programming-java |
2 | | -Contains code of different DP problems. |
3 | | - |
4 | | - |
5 | | -### 0/1 knapsack |
6 | | - |
7 | | -* Python implementation on 0/1 Knapsack : [Code](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/pysolution.py) |
8 | | - |
9 | | - |
10 | | -#### Problem Statement Under 0/1 Knapsack: |
11 | | - |
12 | | -1. [SubSet Sum Problem](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/SubSetSum.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/SubSet_Sum.java) |
13 | | - |
14 | | -2. [Equal Sum Partition](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/Equal%20Sum%20Partition.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/Equal_sun_Partition.java) |
15 | | - |
16 | | -3. [Count Subset Sum](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/countsubset.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/Count_Subset_sum.java) |
17 | | - |
18 | | -4. [Minimum Subset Sum Problem](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/Mini_Subset_Sum_Difference.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/Minimum_Subset_Sum_Difference.java) |
19 | | - |
20 | | -5. [Count the number of subset with a given difference](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/Count%20the%20number%20of%20subset%20with%20a%20given%20difference.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/TotalSubsetDifference.java) |
21 | | - |
22 | | -6. [Target Sum](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/TargetSum.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/TotalSubsetDifference.java) |
23 | | - |
24 | | - |
25 | | - |
26 | | -#### Problem Statement Under Unbounded Knapsack: |
27 | | - |
28 | | -1. [Cutting the Rod](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/CuttingArod.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Unbounded%20Knapsack/Cutting_A_Rod.java) |
29 | | - |
30 | | -2. [Coin Change : Maximum number of ways](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/CoinChangeMaxNumber.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Unbounded%20Knapsack/CoinChangeMaxNumber.java) |
31 | | - |
32 | | -3. [Coin Change : Minumum Number of Coin](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/coinChangeMinCoin.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Unbounded%20Knapsack/CoinChangeMinNumber.java) |
33 | | - |
34 | | - |
35 | | -#### Longest Common Subsequence |
36 | | - |
37 | | -1. [Longes Common SubSequence Using Recursive](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/LongestCommonSubsequence.txt) : [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/tree/master/Longest%20Common%20Subsequence) |
| 1 | +# Dynamic-Programming-java |
| 2 | +Contains code of different DP problems. |
| 3 | + |
| 4 | + |
| 5 | +### 0/1 knapsack |
| 6 | + |
| 7 | +* Python implementation on 0/1 Knapsack : [Code](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/pysolution.py) |
| 8 | + |
| 9 | +#### Problem Statement Under 0/1 Knapsack: |
| 10 | + |
| 11 | +| Problem Statement | Solution | |
| 12 | +| :----------------------------------------------------------- | :----------------------------------------------------------- | |
| 13 | +| 1. [SubSet Sum Problem](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/SubSetSum.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/SubSet_Sum.java) | |
| 14 | +| 2. [Equal Sum Partition](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/Equal%20Sum%20Partition.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/Equal_sun_Partition.java) | |
| 15 | +| 3. [Count Subset Sum](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/countsubset.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/Count_Subset_sum.java) | |
| 16 | +| 4. [Minimum Subset Sum Problem](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/Mini_Subset_Sum_Difference.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/Minimum_Subset_Sum_Difference.java) | |
| 17 | +| 5. [Count the number of subset with a given difference](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/Count%20the%20number%20of%20subset%20with%20a%20given%20difference.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/TotalSubsetDifference.java) | |
| 18 | +| 6. [Target Sum](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/TargetSum.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/0-1%20knapsack/TotalSubsetDifference.java) | |
| 19 | + |
| 20 | + |
| 21 | + |
| 22 | +#### Problem Statement Under Unbounded Knapsack: |
| 23 | + |
| 24 | +| Problem Statement | Solution | |
| 25 | +| ------------------------------------------------------------ | ------------------------------------------------------------ | |
| 26 | +| 1. [Cutting the Rod](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/CuttingArod.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Unbounded%20Knapsack/Cutting_A_Rod.java) | |
| 27 | +| 2. [Coin Change : Maximum number of ways](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/CoinChangeMaxNumber.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Unbounded%20Knapsack/CoinChangeMaxNumber.java) | |
| 28 | +| 3. [Coin Change : Minumum Number of Coin](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/coinChangeMinCoin.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Unbounded%20Knapsack/CoinChangeMinNumber.java) | |
| 29 | + |
| 30 | + |
| 31 | + |
| 32 | +#### Longest Common Subsequence: |
| 33 | + |
| 34 | +| Problem Statement | Solution | |
| 35 | +| ------------------------------------------------------------ | ------------------------------------------------------------ | |
| 36 | +| 1. [Longes Common SubSequence Using Recursive](https://.com/mohitsingla123/Dynamic-Programming-java/blob/master/Problem%20Statement/LongestCommonSubsequence.txt) | [Java Solution](https://.com/mohitsingla123/Dynamic-Programming-java/tree/master/Longest%20Common%20Subsequence) | |
| 37 | +| | | |
| 38 | +| | | |
0 commit comments