Advent of Code 2025 Progress

David's Progress

Day	Part1	Part2	Time (m)	Notes	Status
01	✅	✅	17:00, 1:15:00	Pretty easy XD JK	DONE
02	✅	✅	33:32, 23:55	Found solution but its O(n^2). Not super efficient. Could found better if I took more time	DONE
03	✅	✅	17:57,1:03:19	Forgot to clear sum from pat1 in part 2 (sum=0). so solution kept being off by a little.	DONE
04	✅	✅	1:06:22, 34:00	Got it.. but at what time cost :( . Solution at least is readable and is not a billion if statements chained together . Also solution 2 is pretty elegant, only a slight change from solution 1	DONE
05	✅	✅	9:02, 33:17	I'm overthinking it with fancy hasmaps and sets. The part 1 is trivial: Record time of under 10 min. and barely 33 min for part 2 :)	DONE
06	✅	✅	6:01, 1:22:22	Really trivial part 1. List comprehension OP in python. Part 2's solution is obvious but the implementaion is array index hell. Im sure it's possible with some insane list comprehension or using numpy or other array/matrix libraries. i did it the old way : for j: for k: for i way and it was a headache.	DONE
07	✅	✅	38:40 : 18:14	Interesting problem to use OOP. Solution 1 is very readable . Part 2 done in record time🌟!! All thanks to my OOP representation which allows flexibility and adding new behaviour!	DONE
08	✅	✅	1:36:07 , 17:56	Pain. but once again OOP and extension of behaviour wins.	DONE

Shanvin's Progress

Day	Part1	Part2	Time (m)	Notes	Status
01	✅	✅	total: 30:00		DONE
02	✅	✅	16:10, 42:00	P2 took so long, non-optimal solution too	DONE
03	✅	✅	18:50, 23:00	Forgot to update largest pointer	DONE
04	✅	✅	15:30, 4:08	P2 ez pz, most fun one I did til now	DONE
05	✅	✅	Around 45 min, 3:30	Fun one	DONE
06	✅	✅	9:09, 33:16	Really struggled with P2 because of my main where I stripped first and last char, took me a while to understand that was the bug. Logic was good since the start though so W. Didn't bother to check main because in my head I didn't think a single .strip() statement that I use trivially would mess up the whole flow of my function but lesson learned	DONE
07	✅		34:46,	P1 cooked me, didnt read question well and neglected the split immediately rule	TODO
08	✅				TODO
09	✅		25:20,	Crazily unoptimal for P1 O(n^2)	TODO

Atai's Progress

Day	Part1	Part2	Time (m)	Notes	Status
01	✅	-	0		TODO
02	-	-	0		TODO

AI Usage Wall of Shame

Name	Times Used AI	Notes
Shanvin	2	First strike (Had to go to work so peeked at solution for Day1 Pt2), Second strike (day 6 P2), used it to clear the bug regarding .strip(). Logic was good but formatting error messed up the whole logic
David	1	Had to solve a dumb bug ( forgot to clear sum )
Atai	0	Pure skill 😎

Status values: TODO, In Progress, Done.

Leaderboard