advent21 VS Advent-Of-Code

You can try to read my walkthrough... You cannot just match one edge to another edge, as there may be match in magnitude but are in fact totally off. You have to test for all edges, and you'll eventually know if two scanners line up if there's more than just two 'lucky' points (i.e. edge) that exists for both scanners.

Nim with my walkthrough here. Similar to the other solutions, just brute-forcing all possible moves for Dijkstra's algorithm. My walkthrough simply explains how to figure out the valid moves to do so, turns out it isn't too hard after having written it down (and simplifying my code).

Part1 and part2

Solution: https://github.com/tymscar/Advent-Of-Code/tree/master/2022/typescript/day02

Thought about doing it in Typescript this year. You can find part1 here and part2 here!

Today was way easier than the past week which is great, because I can relax a bit. I have rushed the code, so its not the greatest, but its here, in Javascript, if you want to see!

Today was insane for me. Basically spent like 10 hours working on it, but I started from scratch in the last hour and got both parts. I made very stupid mistakes such as reversing the values when reading them or writing a 2 instead of a 3. I am tired, but we are almost at the end! Part1 and part2 in Javascript.

Part1 and part2 in Javascript. Beware, code is ugly, didnt have time to clean it up and it also runs in like 3 minutes... :(

Part1 and part2 in Javascript

Today was very enjoyable, albeit a bit easier than expected after what was yesterday, haha. Part1 and part2 in Javascript

I think today was very difficult because of the way the problem was layed out. Most of what you need to do for part2 was explained in part1 for no reason and the example werent exhaustive. I tried doing it with sets, then I also tried bruteforcing it and in the end I ended up doing a more manual approach which is very ugly but I am too tired to refactor rigth now. Part1 and part2 in Javascript.