My solutions to the Advent of Code 2019.
Day | Puzzle 1 | Puzzle 2 |
---|---|---|
1 | Solved | Solved |
2 | Solved | Solved |
3 | Solved | Solved |
4 | Solved | Solved |
5 | Solved | Solved |
6 | Solved | Solved |
7 | Solved | Solved |
8 | Solved | Solved |
9 | Solved | Solved |
10 | Solved | Solved |
11 | Solved | Solved |
12 | Solved | Solved1 |
13 | Solved | Solved |
14 | Solved | Solved2 |
15 | Solved | Not attempted3 |
16 | Solved | Solved4 |
17 | Solved | Solved |
18 | Not attempted5 | Not attempted5 |
19 | Solved | Solved |
20 | Not attempted5 | Not attempted5 |
21 | Not attempted5 | Not attempted5 |
22 | Solved | Not attempted3 |
23 | Not attempted5 | Not attempted5 |
24 | Not attempted5 | Not attempted5 |
25 | Not attempted5 | Not attempted5 |
I've chosen to solve the puzzles using C# so make sure you've got .NET Core 3.1 installed and just run the Console application.
The application will prompt you to enter the day and puzzle numbers. (Note I've deliberately included no real error handling!)
- Read hints on the subreddit to consider using the least common multiple. Hardest challenge yet.
- Read hints on the subreddit to avoid brute force approach.
- Ran out of time on the day to attempt, will try and catch up.
- Read hints on the subreddit to avoid brute force approach and ignore first half of input.
- Too busy getting ready for Christmas, will try and catch up probably after the break.