Classics (non-mandatory)
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Knapsack | 22/99 (22%) | 3.41 | 3.68 |
| B | Longest Increasing Subsequence | 3/16 (19%) | 2.67 | 2.67 |
| C | Minimum Spanning Tree | 0/0 (0%) | -- | -- |
| D | Single source shortest path, non-negative weights | 0/0 (0%) | -- | -- |