4 ms·
AoC is one of my favorite events of the year! I find the puzzles generally approachable, but interesting enough to spend time on. I also like that there's a def
by xavdid 4y ago
AoC is one of my favorite events of the year! I find the puzzles generally approachable, but interesting enough to spend time on. I also like that there's a definitively right answer, which motivates me in an interesting way. I've developed a base class over the years that handles input parsing, so I can focus more on the solutions themselves.
Additionally I've been solving for a number of years, but for the past 2 years, I've done a daily explanation of the solution. I use interesting parts of the Python stdlib and walk readers through common algorithms. I've found it _incredibly_ rewarding and plan on doing it again this year.
You can see all of those solutions here: https://github.com/xavdid/advent-of-code/tree/main/solutions https://github.com/xavdid/advent-of-code/tree/main/solutions
Please let me know if you enjoy reading these, I love hearing from folks!
- katelatte 4y agoThanks for creating this and helping others learn! Amazing effort :)
- xavdid 4y agoYou're very welcome! I hope you (and any other readers out there) have found them useful.
- xdavidliu 4y agowow, your username somewhat resembles mine!
- xavdid 4y agoHa, so it does. A small world. :)
- jabagawee 4y agoI just skimmed through your repo, and I loved the way that you used AoC as an opportunity to share many of the batteries that are included in the Python stdlib. In one particular case, I wanted to also share some more fun corners of the collections module / common algorithms and sent you a pull request.
- xavdid 4y agoThank you for reading! I never thought to accept contributions on here, but these look great. Thank you for sending it over!