Skip to content

Latest commit

 

History

History
27 lines (18 loc) · 1.9 KB

File metadata and controls

27 lines (18 loc) · 1.9 KB

First Year of Attempting 'Advent of Code'

Day one 02.12.2025 @ 02:00

Keen to see how quickly I can solve each one, attempting day one has immediately revealed my fondness for OOP, even on a simple problem I can't help but see everything as an object with a set of properties.

Day two 02.12.2025 @ 15:00

Managed to complete both parts today, and made use of inheritance to clena up both today and yesterdays puzzles

Day three 03.12.2025 @ 17:00

The first part of this was astonishingly easy, the second part took up an embarressing amount of my day. Tried several different solutions that were partially correct before I stumbled upon the windowed search. Then spent ages with a solution that solved the test problem, but which failed the actual goal. Finally realised I had a tiny array splicing bug that would show up if there were duplicate values in the window. Fixed that and everything ran smooth.

Day four 05.12.2025 @ 12:00

Was late getting to this one, but maybe my favourite day so far. Matrices, kernels and filtering ! What a fun little challenge.

Day five 07.12.2025 @ 06:00

Busy couple of days and I've fallen behind once more. Fairly simple, tried brute forcing this at first to rush it, then had to find a way to merge the lists

Day six 08.12.2025 @ 05:43

I completed day 6 ! Wasn't going to, but it was a fairly straightforward bit of string manipulation, so all in all in only took about an hour.

Day seven 10.12.2025 @ 0100

I feel like this should have been fast, but it ended up taking wayyy too long as I chased tiny errors in modifications to the array while looping through.

Day eight 18.12.2025 @ 0400

This one probably took the longest, hadn't tried KD-trees before and then it turned out that was probably the wrong solution and I had to adjust. Also plotting was surprisingly fiddly but I was keen to get an interactive plot, and to illustrate the tree partitions.