Spoiler Warning: If you want to solve the challenges by yourself, don't read the code.
This directory contains the code I used to solve the challenges from Advent of Code 2019.
This year I'm going with go. Solutions can be run with go run main.go.
The following table lists the available solutions by day and language. I also added a short summary for each day. I marked the solutions which I consider especially valuable or pretty with a star (☆).
| Day | Go lang | Description |
|---|---|---|
| 01 | x | Being clever with modulus or just summing |
| 02 | x | Intcode gravity assist |
| 03 | x | Line intersections |
| 04 | x | Filtering numbers |
| 05 | x | Even more intcode stuff |
| 06 | x | Orbit map tree traversal |
| 07 | > | Intcode amplifiers |
| Σ | 6.5 |
I enjoy looking at how other coders solved the riddles to learn even more. This year I follow (A-Z):
- none yet 😇