This repository contains solutions to the Advent of Code challenges. The goal is to write the shortest possible solution for each challenge. This is called "golfing" and is a common practice in programming competitions.
The current best solutions are listed below.
| Day | Part | Author | Bytes | |
|---|---|---|---|---|
| 1 | a | @xem | 54b | 🔗 |
| 1 | b | @xem | 79b | 🔗 |
| 2 | a | @joepdejong | 81b | 🔗 |
| 2 | b | @joepdejong | 82b | 🔗 |
| 3 | a | @xem | 99b | 🔗 |
| 3 | b | @joepdejong | 151b | 🔗 |
| 4 | a | @joepdejong | 82b | 🔗 |
| 4 | b | @joepdejong | 82b | 🔗 |
Everyone is welcome to contribute. Please submit a pull request with your solution. The solution should be placed in a folders named after the day and the subchallenge (e.g. day1/a). The files should be named after the number of bytes in the solution (e.g. 123b.html).
The solution should be a single file and should not require any external dependencies. The solution should be written in JavaScript. There is a template file available to get you started.
Feel free to start working on challenges that are not yet solved. The challenges do not have to be solved in order. You can also try to improve existing solutions. Discussions or ideas are welcome in the issues.