aoc
Advent of Code - mscha's Perl 6 solutions (by mscha)
advent-of-code | aoc | |
---|---|---|
14 | 22 | |
1 | 1 | |
- | - | |
0.0 | 9.0 | |
over 2 years ago | 4 months ago | |
Common Lisp | Raku | |
- | MIT License |
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.
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 2021-12-20.
-
-🎄- 2021 Day 21 Solutions -🎄-
Python. Part a is whatever, part 2 is pretty clean. I wonder if there's a math-only solution to this?
-
-🎄- 2021 Day 20 Solutions -🎄-
Python.
-
-🎄- 2021 Day 19 Solutions -🎄-
Python. Brute force with a tiny bit of pruning, takes about 3 minutes. I've been thinking of switching from CL for days and having the chance to use matrix multiplications finally gave me a great reason to :)
-
-🎄- 2021 Day 18 Solutions -🎄-
Common Lisp Truly ugly day, took me about 4 hours for part 1 and submitted more than 24h past the puzzle for the first :(
-
-🎄- 2021 Day 17 Solutions -🎄-
Common Lisp. Very disappointing problem since you can just brute force over even unreasonable bounds quickly. Would have been more appropriate as a day 4 or 5 problem
-
-🎄- 2021 Day 16 Solutions -🎄-
Common Lisp. Christ this was a sad day. I probably had part 1 in 40 minutes (or I would have if emacs didn't start hanging which necessitated a huge apt-get update/apt-get upgrade 40 minutes in), but then I got hung up until ~3hrs by the "padding" stuff and trying to parse more than one root-level packet from the string. Uggghhh.
-
-🎄- 2021 Day 15 Solutions -🎄-
Simple Dijkstra's in Common Lisp, though I can think of a good heuristic to use with A*. Took me like 10 minute to find a priority queue lib I liked, and about another 15 to figure out I needed to initialize it with a predicate of #'< instead of #'= :/
-
-🎄- 2021 Day 14 Solutions -🎄-
Common Lisp. Pretty bad day, stumbled around for like an hour trying to actually construct the strings for part B and then finished in like 10 mins once I realized how to take the better approach :/
-
-🎄- 2021 Day 13 Solutions -🎄-
Common Lisp. Pretty ugly, I could have merged fold-left and fold-up and the printing logic leaves something to be desired
-
-🎄- 2021 Day 12 Solutions -🎄-
Common Lisp. Got bit really hard twice today, on part a by not knowing that equalp compares strings case-insensitively (wtf!?) and on part b by speedreading and thinking that all small caves could be revisited on a single path
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-09.
- -❄️- 2023 Day 10 Solutions -❄️-
-
-❄️- 2023 Day 9 Solutions -❄️-
Full code at GitHub.
-
-❄️- 2023 Day 7 Solutions -❄️-
Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.
-
-🎄- 2022 Day 13 Solutions -🎄-
New version @GitHub.
-
-🎄- 2022 Day 12 Solutions -🎄-
So, a new version with a lot less almost-duplicate code @GitHub.
- -🎄- 2022 Day 2 Solutions -🎄-
-
-🎄- 2022 Day 1 Solutions -🎄-
@GitHub
-
-🎄- 2021 Day 21 Solutions -🎄-
Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.
-
-🎄- 2021 Day 20 Solutions -🎄-
The rest is the same as my first attempt, but full code at GitHub.
-
-🎄- 2021 Day 18 Solutions -🎄-
I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub
What are some alternatives?
When comparing advent-of-code and aoc you can also consider the following projects:
adventofcode - Advent of code solutions
rockstar - The Rockstar programming language specification
advent-of-code
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode - Solutions for problems from AdventOfCode.com
aoc - Advent of Code Solutions
advent-of-code-2021 - zig solutions to advent of code 2021
adventofcode - Advent of code
Advent-of-Code - Advent of Code
advent-of-code vs adventofcode
aoc vs rockstar
advent-of-code vs advent-of-code
aoc vs advent-2021
advent-of-code vs advent-2021
aoc vs AdventOfCode
advent-of-code vs adventofcode
aoc vs adventofcode
advent-of-code vs aoc
aoc vs advent-of-code-2021
advent-of-code vs adventofcode
aoc vs Advent-of-Code