felixm/aocpy
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Solve 2025 day 1 and 2

Browse Source
This commit is contained in:
Felix Martin
2025-12-14 10:36:32 -05:00
parent e655580b3f
commit 183f909508
3 changed files with 60 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@@ -7,7 +7,13 @@ Solutions and utility script for Advent of Code challenges in Python.
Only twelve problems and no leaderboard this year. That means life will be less
stressful and this will actually be more fun. Thank you Eric Wastl and let's go!
- Day 1:
- Day 1: Maybe the hardest day 1 part 2 ever for me? I struggled to calculate
the number of ticks on 0 directly and ended up just iterating over all the
ticks naively. Maybe I should revisit this.
- Day 2: The simple direct approach with iterating over all the IDs in the
ranges just worked okay. Not pretty but acceptable.
- Day 3:
## AoC 2024