| Day | Fun | Difficulty | Task Description |
|---|---|---|---|
| 1 | ★★☆☆☆ | ★☆☆☆☆ | list sorting and processing |
| 2 | ★★★☆☆ | ★★☆☆☆ | difference constraint checking |
| 3 | ★★★☆☆ | ★★☆☆☆ | use of regular expressions |
| 4 | ★★★★☆ | ★☆☆☆☆ | pattern search in 2D array |
| 5 | ★★☆☆☆ | ★★☆☆☆ | precedence order checking |
| 6 | ★★★★☆ | ★★★☆☆ | maze traversal |
| 7 | ★★★☆☆ | ★★☆☆☆ | 1D depth-first search |
| 8 | ★★☆☆☆ | ★★☆☆☆ | 2D plane coordinate extrapolation |
| 9 | ★★★☆☆ | ★★★☆☆ | disk defragmentation simulation |
| 10 | ★★★☆☆ | ★★☆☆☆ | 2D depth-first search |
| 11 | ★★☆☆☆ | ★★★★☆ | exponential expansion |
| 12 | ★★★★☆ | ★★★★☆ | (nested) connected component analysis |
| 13 | ★★☆☆☆ | ★★★☆☆ | integer 2x2 linear system solving |
| 14 | ★★★★★ | ★★★★☆ | image recognition heuristics |
| 15 | ★★★★☆ | ★★★★☆ | Sokoban simulation |
| 16 | ★★★☆☆ | ★★★★★ | pathfinding with high turn cost |
| 17 | ★★★★☆ | ★★★★☆ | machine code reverse engineering |
| 18 | ★★★☆☆ | ★★★☆☆ | pathfinding + binary search |
| 19 | ★★★★☆ | ★★★☆☆ | regular expression matching |
| 20 | ★★★☆☆ | ★★★★★ | 2D maze solving with shortcuts |
| 21 | ★★★☆☆ | ★★★★★ | recursive pathfinding |
| 22 | ★★★☆☆ | ★★★☆☆ | PRNG implementation, predictor statistics |
| 23 | ★★★★☆ | ★★★☆☆ | maximum clique problem |
| 24 | ★★★★☆ | ★★★★☆ | logic circuit (adder) bugfixing |
| 25 | ★★☆☆☆ | ★★☆☆☆ | 2D pattern overlap checking |