- Python implementation on 0/1 Knapsack : Code
| 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. Matrix Chain Multiplication Recursive | Java Solution |