Advent of Code is a series of programming puzzles released in December each year that can be solved in any programming language. Correctly solving all of the puzzles earns 50 stars.
Total ⭐'s = 24
| Puzzle | Python | R | Notes |
|---|---|---|---|
| Day 01 | ⭐⭐ | ⭐⭐ | |
| Day 02 | ⭐⭐ | ⭐⭐ | |
| Day 03 | ⭐⭐ | ⭐⭐ | |
| Day 04 | ⭐⭐ | ||
| Day 05 | ⭐⭐ | ||
| Day 06 | ⭐⭐ | Part 2 python solution is a little slow | |
| Day 07 | ⭐⭐ | ||
| Day 08 | ⭐⭐ | ||
| Day 09 | ⭐⭐ | Solutions not yet in repo as completed on diferent machines | |
| Day 10 | ⭐⭐ | ||
| Day 11 | ⭐⭐ | ||
| Day 12 | ⭐⭐ | ||
| Day 13 | ⭐⭐ | ||
| Day 14 | ⭐⭐ | Identified the xmas tree by looking for times when the stddev of x and y axis dropped noteably. A stddev of both <25 worked for me, but other inputs might need a small tweak. |