Dynamic Programming I
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 9/78 (12%) | 8.67 | 8.67 |
| B | Longest Increasing Subsequence | 1/15 (7%) | 5.00 | 4.00 |
| C | Errands | 0/5 (0%) | 5.00 | -- |
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 9/78 (12%) | 8.67 | 8.67 |
| B | Longest Increasing Subsequence | 1/15 (7%) | 5.00 | 4.00 |
| C | Errands | 0/5 (0%) | 5.00 | -- |