advent-of-code VS aoc

After that, it was a fairly simple loop, nothing too complicated. The full code is here, and the generated raw brainf*ck is alongside it: 975 lines of nonsense. And that's it! My last brainf*ck solution of the year; i didn't expect to be able to solve that many days: 1, 2, 4, 6, 9, 10, and now 25... I've learned a lot, expended my library of macros quite significantly, and now i know what to clean for next year!

I don't have such functions: i have time-travelling hash-maps. :P

full code: https://github.com/nicuveo/advent-of-code/blob/main/2022/haskell/src/Day17.hs

part 1, original, transpiled

code

code on Github

For part 2, i used the transpiler. I duplicate the buffer of 14 cells, sort it using a bubble sort, and then only do 13 comparisons.

As usual, code on Github, recording on Twitch.

❯ time make run cat input.txt | go run ./aoc12.go 2616490 2507471 make run 3.33s user 0.21s system 101% cpu 3.504 total ❯ ls -alh input.txt -rw-r--r--@ 1 erika staff 29M Dec 14 01:17 input.txt I had to change H, W := 8192, 8192, my Go program is on github

Here's is a GitHub link to my solution for today challenge.

My solution grows a sliding window over the input while scanning it. At any point, it ensures this window to be the largest possible with no repeating symbols. The underlying algorithm is: