This repository contains Python solutions to the 2017 edition of Advent of Code.
| Day | Description | Solution |
|---|---|---|
| 1 | Sum the input. | ⭐⭐ |
| 2 | More sums. | ⭐⭐ |
| 3 | Magic square. | ⭐⭐ |
| 4 | Check the validity of passphrases. | ⭐⭐ |
| 5 | Processing instructions and summing things. | ⭐⭐ |
| 6 | Redistributing memory. | ⭐⭐ |
| 7 | Traversing a graph (tree?) and summing node values. | ⭐⭐ |
| 8 | Parsing expressions with logical conditions from pseudo-code input. | ⭐⭐ |
| 9 | Counting open and closed {} with custom regex escape rules. | ⭐⭐ |
| 10 | Knot hash problem. | ⭐⭐ |
| 11 | Take a walk through a hexagonal field. | ⭐⭐ |
| 12 | Graph traversal problem. | ⭐⭐ |
| 13 | Mostly remainders. | ⭐⭐ |
| 14 | ||
| 15 | While loops and conversion to binary. | ⭐⭐ |
| 16 | Processing instructions. | ⭐⭐ |
| 17 | Spinlock algorithm. | ⭐⭐ |
| 18 | Processing instructions (again). | ⭐⭐ |
| 19 | Follow a path through a routing diagram. | ⭐⭐ |
| 20 | Track particles speeding through space. | ⭐⭐ |
| 21 | Square transformations. | ⭐⭐ |
| 22 | Track a virus through an infinite grid. | ⭐⭐ |
| 23 | Re-create assembly code of the instruction processor from Day 18. | ⭐⭐ |
| 24 | Building strong bridges (recursion). | ⭐⭐❔ |
| 25 | Turing Machine (simple if/else logic). | ⭐ |