Dynamic Programming I
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 2/7 (29%) | 3.50 | 3.50 |
| B | Longest Increasing Subsequence | 1/1 (100%) | 1.00 | 1.00 |
| C | Errands | 1/1 (100%) | 1.00 | 1.00 |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 2/7 (29%) | 3.50 | 3.50 |
| B | Longest Increasing Subsequence | 1/1 (100%) | 1.00 | 1.00 |
| C | Errands | 1/1 (100%) | 1.00 | 1.00 |