Nice simple day, used OOP for the elves.
Making use of the enums from php 8.1
Array intersect dealt with most of the task, then a method to tweak the result of ord to match the specified values in the task
Not much to say here, just a couple of if statements... A bit of regex for the parsing I suppose.
Parsing the data was the main time sink here, also my standard load method trims so that caused issues as well.
Unusually simple. I assume it's the basis for future tasks.
Used a nested data structure with reference to parent object. Once the data was loaded the tasks were really straight forward.
Getting worried about the difficulty spike this weekend. Nothing really of note today.
Had to do a small update for part 2 to allow any number of knots.
Only way I could solve the delay in command execution was to calculate the execution cycles up front and then work through the cycles. This solution meant part 2 was pretty easy.
Fun task, went to the trouble of upgrading the LCM method from my support library to allow more than two parameters, only to realise they were all prime and I could have gotten away with an array_product instead!
Did a full BFS for the first part and was able to reuse it in reverse for part two. Just searched the results for the shortest a location.
Had some trouble with part 1, misunderstood that checking stops on arrays once a successfull match is found. Spaceship operator came in handy then! Changed the comparison method in part 2 to allow it to be used in a usort, part 2 might have looked cleaner if I kept the packets encoded so the search was more efficient.
Had to resort to a couple of cheeky throws to bail out when the sand reached its end goal but on the hole straight forward.
Made an error parsing + didn't include the sign on negative numbers. Worked for the example but spent far too long trying workout the issue. Ended up crazy efficient for part 1 so I was able to brute force part 2 in approx 40s.
Nice + simple part 1. Used a flood fill BFS for part 2, I feel part 2 could be cleaner but it's fast enough.
Used my circular linked list library to control most of the task and made good use of modulus.
Solved part 1 keeping track of calculated values to avoid recalculating them. Recursive function to solve the for x (humn) in part 2.
Pretty straight forward. I was already using a map for the locations rather than generating a full grid so part 2 was a case of letting it run its course for a few seconds.
Tried to use base_convert at first but realised pretty quickly that the numbering ruins that and just wrote the conversion methods.