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 2018.
This year I also used doctest in the Haskell code which is a very quick & easy solution for TDD I think especially with:
fswatch -o . | xargs -n1 -I{} doctest main.hs
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 | Haskell | Description |
|---|---|---|
| 01 | x | Being clever with modulus or just summing |
| 02 | x | Diffing and counting |
| 03 | x | Fabric claim rectangle overlaps |
| 04 | x | Sleep pattern aggregations |
| 05 | x | Desctructive chemistry text processing |
| 06 | Manhattan Voronoi | |
| 07 | > | Steps and requirements |
| Σ | 5.5 |
I enjoy looking at how other coders solved the riddles to learn even more. This year I follow (A-Z):