Tasks with IDs ending in -2 give 1 point for correctness and 1 additional point for speed.
Other tasks only give a point for correctness (but still with some modest speed requirement).
Each theme is annotated with x/y indicating that x out of the y possible points are needed to obtain the full grade.
| Theme | Title | Task ID |
|---|---|---|
| Demo | Max delsum | maxdelsum-2 |
| 1. Sorting (5/7) | Maximum | max |
| Closest pair | closest-2 |
|
| Closest ball | ball-2 |
|
| Inversions | inversions-2 |
|
| 2. Stacks, queues, search trees (5/7) | Reverse Polish Notation | rpn |
| Queue simulation | queue |
|
| Balanced parenthesis checking | dyck |
|
| Median data structure | median-2 |
|
| Dodgeball | dodge-2 |
|
| 3. Search trees, dynamic programming (3/4) | Dynamic min-gap | mingap |
| Order-statistic tree | order |
|
| Longest increasing subsequence | lis |
|
| Longest palindrome subsequence | pal |
|
| 4. Graphs (4/6) | Maze routing | maze |
| Maze multirouting | mazepair-2 |
|
| Short shortest paths | kshort |
|
| Eastwards travel | travel-2 |