AOC2022
Advent of Code 2022, solved in Haskell (by MatthiasCoppens)
advent-of-code
Advent of Code solutions in JS (by leyanlo)
AOC2022 | advent-of-code | |
---|---|---|
9 | 29 | |
0 | 16 | |
- | - | |
10.0 | 9.1 | |
over 1 year ago | 4 months ago | |
Haskell | JavaScript | |
- | Apache License 2.0 |
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.
AOC2022
Posts with mentions or reviews of AOC2022.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-22.
-
-🎄- 2022 Day 23 Solutions -🎄-
Haskell, pretty slow at 9 s.
-
-🎄- 2022 Day 15 Solutions -🎄-
Haskell, by far my slowest solution at 6 s.
-
-🎄- 2022 Day 13 Solutions -🎄-
Haskell, 8 ms.
-
-🎄- 2022 Day 12 Solutions -🎄-
Haskell, 40 ms. I represented the grid as a map (type Grid = M.Map Coord Height) and made the height an Enum instance (data Height = Start | Height Char | End). I think I used Dijkstra?
-
-🎄- 2022 Day 6 Solutions -🎄-
Haskell, 15 ms. Probably my shortest AoC solution ever.
-
-🎄- 2022 Day 5 Solutions -🎄-
Haskell, runs in 10 ms.
-
-🎄- 2022 Day 4 Solutions -🎄-
Haskell, runs in 15 ms. First day this year it made sense to make a monadic parser. I really like to use Text.ParserCombinators.ReadP!
-
-🎄- 2022 Day 3 Solutions -🎄-
Haskell, runs in 4 ms. I feel a little dirty using S.findMin and M.!, but it surely does work pretty good when the input is clean.
-
-🎄- 2022 Day 2 Solutions -🎄-
Haskell, runs in 3 ms. I had some fun with Ord and Enum, there really should be some modular Enum.
advent-of-code
Posts with mentions or reviews of advent-of-code.
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 -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
- -🎄- 2022 Day 15 Solutions -🎄-
- -🎄- 2022 Day 14 Solutions -🎄-
- -🎄- 2022 Day 13 Solutions -🎄-
- -🎄- 2022 Day 12 Solutions -🎄-
- -🎄- 2022 Day 11 Solutions -🎄-
- -🎄- 2022 Day 10 Solutions -🎄-
What are some alternatives?
When comparing AOC2022 and advent-of-code you can also consider the following projects:
aoc2022 - My Advent of Code 2022 solutions!
aoc-2022
aoc2022 - Advent of Code 2022
aoc2022 - Advent of Code 2022 on SCAMP
aoc - Advent of Code
AoC2022
aoc-go - A Golang tool for generating code for Advent of Code
adventofcode
AoC2022 - Solutions to Advent of Code 2022 puzzles.
adventofcode - adventofcode.com solutions
aoc2022
advent-of-code-2022