AoC2021 VS advent-of-code

You can see it written in Rust here: https://github.com/Mahrgell/AoC2021/blob/main/aoc21-24/src/main.rs

Rust, Brute Force, < 1min

Part 1: Over complicated, does several twists on the map, adding in extra .... lines where needed. Then plots where each galaxy [x,y] is, loop through each against any further galaxies. Simple difference between the x and y cords gives the distance. Sum all together.

Part 2: Using the Part 1 as a start point for moving around the path, this time I created a grid twice the size and then tracked each space I moved around filling in the gap between the neighbouring cells, this then left a 1 "pixel" gap for later. Ran a flood fill function at 0,0. My first attempt at a recursive function caused JS to RangeError: Maximum call stack size exceeded so I Googled some JS flood fill functions and adapted one. Finally I ran through all the even pixels, counting any that remained empty.

Part 1: Loop creating an array of differences to add to the main array, until you reach 0,0,0. Take the last number from each and add to get the next in the sequence.

Part 1: Pretty simple, sure I could reduce it a bit, but was quick with the answer.

Part 1: Parsed the input first, creating two scores for each hand, the first was how good the hand was giving 7 for a five of a kind, down to just 1 for high card. The second was an integer value of the hand in sudohex (T -> a, J -> b, Q -> c, K -> d, A -> e). I then just ran a quick sort on the array, using these two values to compare. (Thinking about it, I could have just appended the score from the first calc to the sudohex as it would have been the most significant digit).

Part 1 - simple brute force loop

Part 1 - Brute force, but was please with my parsing logic. Solved on day 5. When I realised what Part 2 needed, tried the brute force option whilst going away for lunch, but when I returned and it was still running knew that it wasn't going to be a great idea.

Part 1 Part 2