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