aoc
Advent Of Code (http://adventofcode.com/) solutions (by mkst)
aoc
Advent of Code solutions (by vodik)
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.
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 2022-10-08.
-
2015 Day 5: Doesn't He Have Intern-Elves For This?
My Python solution from many years ago: https://github.com/mkst/aoc/blob/master/2015/05.py. Also have a Go version alongside if that helps?
-
Got answer but want to learn to better optimize for speed (2015, Day 6 Part 2)
This is my solution: https://github.com/mkst/aoc/blob/master/2015/06.py. i haven't looked at it for quite a long time, but one difference is I'm doing the heavy lifting in terms of parsing the input upfront, so my loops have fewer if statements. Not at my PC to see how long this takes though.
-
[AOC 2015 day 15 (golang)]
This is my golang solution if it helps? I solved 2015 in a few different languages, and this was my first foray into golang... https://github.com/mkst/aoc/blob/master/2015/15.go
-
Day 14 part 2, a different way of solving?
Count each pair... like the lantern fish. Fairly instant in an interpreted language. https://github.com/mkst/aoc/blob/master/2021/14.q. The only gotcha was that there were duplicate pairs in the initial input.
-
2021 Day 4 Approach and other ideas?
For each board I created a bitmask to track called numbers. Iterate through the bingo calls. If the call results in a line, I return the "answer" otherwise return the updated bitmask. After iterating over all boards I have a list of results, then for part 1, pick the first result that was a number rather than bitmask, and part 2 find the last result... It's pretty horrible when explained in words, but the code is.. ok-ish. https://github.com/mkst/aoc/blob/master/2021/04.q
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 2022-01-10.
-
[2021 Day 23 Part 1&2] Is this strategy feasible for computing programmatically the optimal cost?
Its not amazingly clear code, but here it is for what its worth: https://github.com/vodik/aoc/blob/main/aoc-2021/src/day23.rs
-
-🎄- 2021 Day 16 Solutions -🎄-
Rust
-
2021 Day 4 Approach and other ideas?
With this, I managed to achieve a solution that's 6-7µs for part1 and ~10-11µs for part2 in Rust.
What are some alternatives?
When comparing aoc and aoc you can also consider the following projects:
pony_aoc2021 - Advent of Code 2021 in Pony
specter - Clojure(Script)'s missing piece