Dynamic Programming I
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 89/597 (15%) | 5.58 | 5.20 |
| B | Longest Increasing Subsequence | 44/160 (28%) | 3.02 | 2.91 |
| C | Errands | 29/119 (24%) | 3.50 | 2.97 |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 89/597 (15%) | 5.58 | 5.20 |
| B | Longest Increasing Subsequence | 44/160 (28%) | 3.02 | 2.91 |
| C | Errands | 29/119 (24%) | 3.50 | 2.97 |