Last published - day 16.1
| Day | Problem | Solution |
|---|---|---|
| 1.1 | ||
| 1.2 | ||
| 2.1 | ||
| 2.2 | ||
| 3.2 | ||
| 3.2 | ||
| 4.2 | ||
| 4.2 | ||
| 5.1 | ||
| 5.2 | ||
| 6.1 | ||
| 6.2 | ||
| 7.1 | ||
| 7.2 | ||
| 8.1 | ||
| 8.2 | ||
| 9.1 | ||
| 9.2 | ||
| 10.1 | ||
| 10.2 | ||
| 11.1 | ||
| 11.2 | ||
| 12.1 | Recursion | |
| 12.2 | Recursion with perimeter calc | |
| 13.1 | Dynamic programming | |
| 13.2 | Cramer's Rule | |
| 14.1 | Multiple Robot position prediction., Time limited | Lowest score |
| 14.2 | Ditto, but no time limit. Continue until xmas tree seen, but no clue as to the shape or size of the tree | Lowest score indicates robots concentrated in one quadrant |
| 15.1 | Robot pushing stacks of boxes | Recursive search of all boxes in robot's path |
| 15.2 | Ditto, but boxes are 2 by 1 and can move in 1 buy 1 steps | Recursive again, but logic needed to recognise where boxes overlap |
| 16.1 | Pathfinding with corner cost complication | Dijkstra & A* Algorithms |
| 16.2 | All best paths | BFS? |