advent-of-code-2021 VS aoc-2021

I've done every year in Haskell (2015 2016 2017 2018 2019 2020 2021), and so have several other people such as /u/glguy. I don't see if /u/mstksg has anything published for 2015 but they've done 2016 2017 2018 2019 2020 2021 along with some pretty good writeups, I recommend checking those out.

Again this year I am posting my reflections for solving all of these in Haskell https://github.com/mstksg/advent-of-code-2021/blob/master/reflections.md :)

Like every year, i have my haskell solutions and reflections every day here :) https://github.com/mstksg/advent-of-code-2021

I used two sets containing respectively the positions of the down-facing and right-facing sea cucumbers: link to solution

Solution

(full code) My solution is quite similar to this one, just to have fun I decided to use a typeclass Intersectable with an instance for both Ranges and Cuboids:

(full code)

My solution, I treated the binary input as strings of 0s and 1s instead of arrays of bools, it made the parsing easier using Parsec

I used a Map to track the occurrences of each monomer and updated it as many times as needed using the input's rules (full code here)

I solved the problem using a set of points and literally folding over it: (code here)

(Full code here) I used a map to represent the graph, basically I treated a Graph a as a Map a [a]

Any feedback is greatly appreciated! The full code for handling the matrix and the flash function is here

My solution is here