aey/advent-of-code
0
0
Fork 0
Code Issues Pull requests 4 Projects Releases Packages Wiki Activity Actions
advent-of-code/2025-python/output
History
Anders Englöf Ytterström 044df24990 Solve 2025 day 11 pt 1-2 
For p1 a BFS algorithm is fast enough. For pt 2,
for the third day in a row, it did not work.

I caved in and used recursion and memoisation for
DFS instead, instantly fast as lightning.

I finished by making the pt 2 code compatible with
pt 1.
2025-12-11 21:42:15 +01:00
..
__init__.py Solve 2025 day 9 pt 2 2025-12-10 00:35:25 +01:00
day_01.py Solve 2025 day 1 pt 1-2 2025-12-10 00:34:12 +01:00
day_02.py Solve 2025 day 2 pt 1-2 2025-12-10 00:34:12 +01:00
day_03.py Solve 2025 day 3 pt 1-2 2025-12-10 00:34:12 +01:00
day_04.py Solve 2025 day 4 pt 1-2 2025-12-10 00:34:12 +01:00
day_05.py Solve 2025 day 5 pt 1-2 2025-12-10 00:34:12 +01:00
day_06.py Solve 2025 day 6 pt 1-2 2025-12-10 00:34:12 +01:00
day_07.py Solve 2025 day 7 pt 1-2 2025-12-10 00:34:12 +01:00
day_08.py Solve 2025 day 8 pt 1-2 2025-12-10 00:34:12 +01:00
day_09.py Solve 2025 day 9 pt 2 2025-12-10 00:35:25 +01:00
day_10.py day 10 2025-12-11 20:45:13 +01:00
day_11.py Solve 2025 day 11 pt 1-2 2025-12-11 21:42:15 +01:00