adventOfCode
By JLHwung
aoc2021
Solutions to advent-of-code (https://adventofcode.com/) for 2021 (by fizbin)
adventOfCode | aoc2021 | |
---|---|---|
1 | 11 | |
0 | 1 | |
- | - | |
0.0 | 0.0 | |
over 1 year ago | over 2 years ago | |
Rust | Python | |
- | - |
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.
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 2021-12-21.
aoc2021
Posts with mentions or reviews of aoc2021.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-01-01.
-
[2021 Day 24][Python] A brute-force solution in 170 seconds
With only a few small restrictions down from "fully general", I have a brute-force-ish solution in python running in about 15 seconds on my hardware and my input: https://github.com/fizbin/aoc2021/blob/main/aoc24b.py
-
Happy New Year guys! I want to share my recap of Advent of Code 2021, I hope this is allowed.
With day 22, I actually have three different python approaches in my repo; the inclusion/exclusion approach is what I named aoc22c.py.
-
[2021 Day 24] I may have done something clever, I wonder if anyone else used this approach
This sounds vaguely similar to the approach I took on my second python solution, minus one optimization that I used: namely, I determined the maximum allowable value of "z" at the end of each instruction if we were going to end the program with z=0 and used that to throw away states that weren't worth pursuing.
-
2021 Day 22 (Part 2) This algorithm may not be optimal
I've implemented that approach, and my code to do so takes less than five seconds on my machine, so I wonder: have you tried this on the sample input? What does it do there?
- What have been the most computationally complex puzzles over the years (i.e. takes most runtime to complete)?
-
-🎄- 2021 Day 22 Solutions -🎄-
How about a python translation of my haskell solution?
-
Advent of Code 2021 day 22
My solution in my github repo
-
Advent of Code 2021 day 21
Here's the more straightforward Monad-based solution, which unfortunately takes well over a minute to run.
- -🎄- 2021 Day 16 Solutions -🎄-
What are some alternatives?
When comparing adventOfCode and aoc2021 you can also consider the following projects:
AdventOfCode2021 - My solutions to https://adventofcode.com/2021
aoc-2021 - AOC challenge in Haskell
advent_of_code - :christmas_tree: Advent of Code 2021 in Kotlin :christmas_tree:
Advent_of_code_2021 - Rust solutions for advent of code 2021