AdventOfCode VS AdventOfCode2023

Here's the optimized Part 2: https://github.com/rtrinh3/AdventOfCode/blob/f277486bb7f9501c208e1c70c791738bb277c5f1/Aoc2023/Day05.cs

[LANGUAGE: C] Part 1 I implemented the breath-first search algorithm not realizing that I could have measured the length of the loop and divided in half. Part 2 was a bit of a struggle for me. At some point I figured that the best way of solving it was to print the path with box building unicode characters, put a screenshot of it into gimp, fill the inside of the path with the fill tool, and then count the number of periods in the filled region. For some reason, this didn't work and I'm not going to debug that janky solution. I eventually found the path tracing algorithm for determining if a point was in a polygon and realized that that was very easy to implement here. While my code is messy, the output for part 2 looks really cool as it prints the loop, I'll probably upload it as a visualization.

[LANGUAGE: C] 7571/5056 Took me a while to solve part 1 but Part 2 was a really easy modification. I used C's built in qsort function to calculate the ranks which is cool.

[LANGUAGE: C] Part 1 Part 2 4899/5869 easiest one so far. Did a naive approach literally following the steps it gave me and it still ran instantly. No one is heating their homes with this one.