advent of code solutions written in nim
| # | comment | link |
|---|---|---|
| 1 | Here we go again | Day 1 |
| 2 | CPU again :) based it on last year's code so it didn't take many minutes to solve | Day 2 |
| 3 | Meh, messy code. Sets are pretty cool I guess. | Day 3 |
| 4 | There is a clever solution hiding somewhere but I don't have the motivation to find it. | Day 4 |
| 5 | CPU is progressing nicely. Still quite clean code. Lots of fun! | Day 5 |
| 6 | Happy with my code. Realized I could use sets to solve part 2 using the fancy symmetric difference operator '-+-' 🥳 | Day 6 |
| 7 | Struggled a bit with this one. Had to refactor the code to allow multiple cpus. | Day 7 |
| 8 | Got stuck for 15 minutes because I tried to do a reversed double-dot for loop (for x in 10..0:). This really should be allowed in Nim. |
Day 8 |
| 9 | IntCode computer again. Struggled with Nim, got some errors when trying to nest templates to much, but it turned out nice in the end. | Day 9 |
| 10 | Figured out early to use polar coordinates but got stuck with the implementation details. Really crappy code that I don't want to look at again. | Day 10 |
| 11 | IntCode again that draws an image. Bad code again. | Day 11 |
| 12 | N-body simulation. Really like the simplicity of the simulation! Code works but I didn't find any time to make it pretty. Got stuck on part 2 because I was certain it had a "warm up" time after which it fell into a cycle. I was wrong about this. | Day 12 |
| 13 | It's a breakout game! Easy problem and cool visualization! :D | Day 13 |
| 14 | Gahhh, this one took alot of time to solve. Strange equation solving and graphs. Solved part 2 using a home made binary search. | Day 14 |
| 15 | IntCode + Pathfinding. Learned how to do a breadth first search using a queue. | Day 15 |
| 16 | Patterns and repetitions. I have yet to solve Part 2. | Day 16 |
| 17 | Droid IntCode stuff. The most horrible code written in the history of the human race. Don't look. | Day 17 |