| Day | Fun | Difficulty | Task Description |
|---|---|---|---|
| 1 | ★★★☆☆ | ★★☆☆☆ | add numbers to find a repetition |
| 2 | ★★☆☆☆ | ★★☆☆☆ | apply rules to a list of strings |
| 3 | ★★★☆☆ | ★★☆☆☆ | count patches on a 1Kx1K sparse 2D grid |
| 4 | ★★★★☆ | ★★★☆☆ | schedule statistics |
| 5 | ★★★★☆ | ★★★☆☆ | string manipulation |
| 6 | ★★★★☆ | ★★★☆☆ | 2D Voronoi diagram |
| 7 | ★★☆☆☆ | ★★★☆☆ | make-like dependency graph |
| 8 | ★★★★☆ | ★★☆☆☆ | unserialize a tree |
| 9 | ★★☆☆☆ | ★★★☆☆ | circular linked list manipulation |
| 10 | ★★★★★ | ★★☆☆☆ | particle simulation |
| 11 | ★★★☆☆ | ★★★★☆ | summed-area tables |
| 12 | ★★★★☆ | ★★★☆☆ | infinite 1D cellular automaton with repeating pattern detection |
| 13 | ★★★★☆ | ★★★★☆ | follow a 2D track layout |
| 14 | ★★☆☆☆ | ★★★☆☆ | millions of iterations of a complex PRNG |
| 15 | ★☆☆☆☆ | ★★★★★ | complex 2D grid battle simulation |
| 16 | ★★★★★ | ★★☆☆☆ | decoding a fictional CPU's opcodes |
| 17 | ★★★★☆ | ★★★★☆ | 2D grid flood filling |
| 18 | ★★★★☆ | ★★★☆☆ | 50x50 2D cellular automaton with cycle detection |
| 19 | ★★☆☆☆ | ★★★★☆ | reverse engineering |
| 20 | ★★☆☆☆ | ★★★★☆ | regular expression expansion |
| 21 | ★★☆☆☆ | ★★★★☆ | reverse engineering |
| 22 | ★★☆☆☆ | ★★★★★ | infinite 3D grid pathfinding |
| 23 | ★★☆☆☆ | ★★★★★ | huge 3D area search |
| 24 | ★★☆☆☆ | ★★★☆☆ | turn-based battle simulation |
| 25 | ★★★☆☆ | ★★★☆☆ | 4D connected-component search |
2018
Directory actions
More options
Directory actions
More options
2018
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||