AdventOfCodeHaskell
solutions to advent of code problems (by c-coward)
adventofcode
Advent of code solutions (by mathsaey)
AdventOfCodeHaskell | adventofcode | |
---|---|---|
13 | 55 | |
0 | 20 | |
- | - | |
10.0 | 7.8 | |
over 1 year ago | 5 months ago | |
Haskell | Elixir | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
AdventOfCodeHaskell
Posts with mentions or reviews of AdventOfCodeHaskell.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-24.
-
-🎄- 2022 Day 25 Solutions -🎄-
Haskell. I love balanced base systems! Was just telling my less-math inclined partner about them a bit ago :)
-
-🎄- 2022 Day 13 Solutions -🎄-
Haskell. Implementing nested lists is fun! The parser was surprisingly straightforward (except for an issue where it was expecting an extra newline at the end of my input), and the bulk of the problem was handled by implementing Ord instances for my data types.
-
-🎄- 2022 Day 12 Solutions -🎄-
Haskell. Recursive BFS in the State monad! Visited positions are marked with a '|' character, since this is 'z' + 2. My part 1 code didn't need too much modification for part 2, I only needed to account for the fact that adjacent 'a's can visit each other on the first step.
-
Advent of Code 2022 day 12
Code. Recursive BFS using the State monad to update grid positions
-
-🎄- 2022 Day 10 Solutions -🎄-
Haskell. Both parts are one liners, I add a no op before every addx to avoid skipping cycles, and using a 2D point data type (that I custom implemented based on Linear.V2 for named fields) makes handling the data a breeze!
-
[2022 Day 9] Shortest rope with fixed tail
346 for me. would've loved this as a part 3, since my solution adapts to it really well!
-
Did anyone else build a full tree for day 7?
Something that really helped me out was finding a Tree Zipper library! This one doesn't have the best documentation but it was the only one that wanted to compile in my project lol. It does a lot of the heavy lifting of traversing the tree for you, once you figure out how to use it of course. Here's my not very cleaned up code if you wanna see what I did
-
-🎄- 2022 Day 9 Solutions -🎄-
Haskell. My idea for part 1 was basically "Find all the places the head goes, then follow it with the tail" which ended up working basically for free in part 2, and I chose the lazy implementation of "just compose these functions together manually, its what the language was built for". Definitely going to refactor that part in the morning lol
-
Advent of Code 2022 day 9
Pretty happy with my code, which amounts to a bunch of composed scanls, my part 1 solution gave me part 2 for free! Code
-
Advent of Code 2022 day 8
Code for the day, with parsing and extra utilities located in src/Util/
adventofcode
Posts with mentions or reviews of adventofcode.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
-
-❄️- 2023 Day 10 Solutions -❄️-
Part one went fairly fast, but spent quite some time on getting part two right. I settled on the approach of just iterating over the grid and using a boolean to see if I had to count elements or not. However, I had some issues figuring out when to swap, this post by /u/rogual helped me figure it out. After that I lost quite some time on an error that only occurred with my input, not with the example input. It turned out that my loop (which I take form my p1 solution) didn't include the start node, which caused all sorts of counting issues.
-
-❄️- 2023 Day 4 Solutions -❄️-
[Language: Elixir] https://github.com/mathsaey/adventofcode/blob/master/lib/2023/4.ex
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
- -🎄- 2022 Day 20 Solutions -🎄-
- -🎄- 2022 Day 19 Solutions -🎄-
- -🎄- 2022 Day 18 Solutions -🎄-
What are some alternatives?
When comparing AdventOfCodeHaskell and adventofcode you can also consider the following projects:
aoc2022
AdventOfCode2021 - Advent of code 2021
Advent-of-code - https://adventofcode.com/
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
aoc2022
adventofcode - Answers to Advent of Code
advent2022 - Advent of Code 2022
aoc2021 - Advent of Code 2021 - my answers
aoc2022
rockstar - The Rockstar programming language specification
advent-of-code - Advent of Code solutions
roast - 🦋 Raku test suite
AdventOfCodeHaskell vs aoc2022
adventofcode vs AdventOfCode2021
AdventOfCodeHaskell vs Advent-of-code
adventofcode vs adventofcode
AdventOfCodeHaskell vs aoc2022
adventofcode vs adventofcode
AdventOfCodeHaskell vs advent2022
adventofcode vs aoc2021
AdventOfCodeHaskell vs aoc2022
adventofcode vs rockstar
AdventOfCodeHaskell vs advent-of-code
adventofcode vs roast