AOC2022
Advent of Code 2022, solved in Haskell (by MatthiasCoppens)
AoC
my personal repo for the advent of code yearly challenge (by Fadi88)
AOC2022 | AoC | |
---|---|---|
9 | 87 | |
0 | 18 | |
- | - | |
10.0 | 8.1 | |
over 1 year ago | 5 days ago | |
Haskell | Python | |
- | GNU General Public License v3.0 or later |
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.
AoC
Posts with mentions or reviews of AoC.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-10.
-
-❄️- 2023 Day 11 Solutions -❄️-
20ms both parts https://github.com/Fadi88/AoC/blob/master/2023/day11/code.py
- -❄️- 2023 Day 9 Solutions -❄️-
- -❄️- 2023 Day 8 Solutions -❄️-
- -❄️- 2023 Day 7 Solutions -❄️-
-
-❄️- 2023 Day 6 Solutions -❄️-
Same Algo as my python code from earlier, now just using math not search space reduction also blazing fast in micro seconds https://github.com/Fadi88/AoC/tree/master/2023/day06
- -❄️- 2023 Day 5 Solutions -❄️-
- [2022-day16] python port to rust performance question
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
What are some alternatives?
When comparing AOC2022 and AoC you can also consider the following projects:
aoc2022 - My Advent of Code 2022 solutions!
advent-of-code - My solutions for Advent of Code
aoc2022 - Advent of Code 2022
adventofcode - Solutions for problems from AdventOfCode.com
aoc - Advent of Code
aoc2020 - Advent of Code 2020 - my answers
aoc-go - A Golang tool for generating code for Advent of Code
AdventOfCode-Java - adventOfCode(Language.JAVA);
AoC2022 - Solutions to Advent of Code 2022 puzzles.
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
aoc2022
aoc2021 - Advent of Code 2021 Solutions