advent_c VS advent

C, it's not often that you get to use monotonic stacks, but they're pretty awesome. I think I could clean this up further into a single generic handler and two functions that do the lifting, but I'm not sure that it would be any cleaner or easier to read. [Github]

C, some annoying input parsing and then very straightforward tree walking. Was expecting something a lot harder in part 2, so originally over-engineered, and ended up ripping a bunch of stuff out when part 2 was just another walk of directory sizes. ¯_(ツ)_/¯ [Github]

C, the index handling in findMarker feels a little gross but if that's the worst code I write during AOC2022 I'll be pretty happy. [Github]

C, this was the first day that parsing the input took significantly longer than solving the problem. I'm happy with the approach I ended up taking, though. [Github]

C, it's quiet... too quiet. Waiting for the monster to jump out of the closet in a few days. [Github]

C - we don't need no stinking sets! Because we have uint64_ts and masking. [Github]

No heap allocations: https://github.com/tsenart/advent/blob/master/2023/4

~200 microseconds runtime Go solutions based on BFS that plot the path in the terminal: https://github.com/tsenart/advent/tree/master/2022/12

Also doing it in Go: https://github.com/tsenart/advent

Nice. I did that but traversing all directions in each inner loop iteration: https://github.com/tsenart/advent/blob/master/2022/8/one.go