Skip to content

Source code used to obtain answers to various editions of Advent of Code

License

Notifications You must be signed in to change notification settings

itsbudyn/advent-of-code

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

32 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

advent-of-code

Welcome to my repository containing source code and inputs used to obtain answers to various editions of Advent of Code.

  • Fully written in Python
  • All of these have been written by me:
    • No pasted source code (neither parts nor its entirety)
    • No spoiling the solution.
    • Only form of help used was searching how to use some library (e.g. re) or something else in Standard Python (like: generating a 2d array with X and Y dimensions)
    • And most importantly, absolutley ZERO LMs used in any capacity (no ChatGPT, Copilot or any other)

In order not to spoil the event, this repository will be hidden during any ongoing editions of the Advent of Code in which I'm taking part.


Completion

Legend:

  • ✅ · Completed
  • 🔜 · Not attempted yet
  • ❌ · Gave up
Year Task 12345678910111213141516171819202122232425
2023 1🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜
2🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜
2022 1🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜
2🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜
2021 1🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜
2🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜
2015 1🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜
2🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜🔜

Notes

Year Day 1 2 Notes
2023 5 Part 2 counts location from 1 and tries to find matching seed by traversing the map in reverse. I have no further ideas how to make it more efficient.
Exec time: 6:54.668 on Ryzen 5 5600X
2022 5 Uses hardcoded arrays instead of loading from file
2022 9 Will probably have to redo most of the code if I want to complete 9.2
2022 11 Gave up on part 2
2022 13 Part 2 does not sort the packets =)
2022 15 Gave up on entire day

About

Source code used to obtain answers to various editions of Advent of Code

Resources

License

Stars

Watchers

Forks

Languages