advent21 VS AdventOfCode

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).

C# Solution 29/334

C# 34/34

C# Solution (one of the less nice-looking ones even after cleanup)

C# solution (cleaned up)

C# solution. Was around 1:57. I would have been earlier but I accidentally counted the length of the input instead of the increasing pairs, so I had to wait the penalty time.