Advent-of-code VS aoc2022

https://github.com/0xmycf/Advent-of-code/blob/main/2022/aoc22/src/Days/Day10.hs Today is very verbose, but I wanted to use Lenses and State again. Went pretty ok all in all. The only thing I got wrong in the beginning was the ticking, this probably lead to some repeated code that I could have avoided if I understood the assignment right away.

Technically today should have been fun, but I just didn't see that signum will solve everything... then my snake was one point to short and I didn't notice... All in all pretty messy but I was able to clean it up: https://github.com/0xmycf/Advent-of-code/blob/main/2022/aoc22/src/Days/Day09.hs Finally used State though!

https://github.com/0xmycf/Advent-of-code/blob/main/2022/aoc22/src/Days/Day08.hs I parsed the grid as Map (V2 Int) Int and padded the grid with values of -1. I then used unfoldr with Map.lookup to get all 4 ways for a specific tree. In part A I simply filtered all trees out where the given predicate wasn't fulfilled. In part B I used a modified takeWhile function to take all trees which are smaller + one more than the current tree. I also had to get rid of the -1.

I should have planned more in the beginning, but it turned out fine. I abused Parsecs internal state to give every file the full name: https://github.com/0xmycf/Advent-of-code/blob/main/2022/aoc22/src/Days/Day07.hs

Today was simple, for part a I initially used `zipWith4` and sets but that wasn't an option for part b, so I rewrote how the sets were created. https://github.com/0xmycf/Advent-of-code/blob/main/2022/aoc22/src/Days/Day06.hs

After last years bingo I thought this is going to be tougher...: My solution

https://github.com/0xmycf/Advent-of-code/blob/main/2022/aoc22/src/Days/DayOne.hsI learned Haskell with last years AoC and it was quite a mess... This year is up to a much much better start. Lets see how this year will go :)