aoc2021
Solutions to advent-of-code (https://adventofcode.com/) for 2021 (by fizbin)
advent-of-code
My solutions for the Advent of Code (by JesperDramsch)
aoc2021 | advent-of-code | |
---|---|---|
11 | 10 | |
1 | 6 | |
- | - | |
0.0 | 8.5 | |
over 2 years ago | 5 months ago | |
Python | Jupyter Notebook | |
- | - |
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.
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 -π-
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 2023-12-06.
- -βοΈ- 2023 Day 6 Solutions -βοΈ-
-
-π- 2022 Day 9 Solutions -π-
Code lives here and I scheduled a [blog post here](rope-bridge-solving-advent-of-code).
-
-π- 2021 Day 22 Solutions -π-
In the rest of the code I simply iterate through cubes and multiply the edges with the saved values.
-
-π- 2021 Day 16 Solutions -π-
Today was rough. Code is too long to post here. Github Basically using indexes and a bit of recursion for this.
-
-π- 2021 Day 13 Solutions -π-
It lives on Github and I made a visualization.
-
-π- 2021 Day 12 Solutions -π-
Python 3. Figured I'd learn some more networkx. Was useful for the "smol" attribute in the end and easily getting the neighbors. Full code is on Github.
-
-π- 2021 Day 10 Solutions -π-
The two scorer functions live on Github.
-
-π- 2021 Day 5 Solutions -π-
The full code with comments lives on Github. But here's the meat without comments for brevity:
-
If you're new, know that the example is your first input
And this is how simple it can be to build some relatively robust tests. All of this lives in a tests folder so pytest automatically finds it in a file called test_day05.py. You can see the file on Github.
-
-π- 2020 Day 22 Solutions -π-
Kept it fairly simple in Python. Runs in half a second for both parts together.
What are some alternatives?
When comparing aoc2021 and advent-of-code you can also consider the following projects:
AdventOfCode2021 - My solutions to https://adventofcode.com/2021
aoc2020 - Advent of Code 2020
aoc-2021 - AOC challenge in Haskell
advent2022
advent_of_code - :christmas_tree: Advent of Code 2021 in Kotlin :christmas_tree:
AdventofCode2022 - My Advent of Code 2022 solutions in Kotlin
Advent_of_code_2021 - Rust solutions for advent of code 2021
AdventOfCode2022 - LΓΆsungen fΓΌr Advent of Code 2022 https://adventofcode.com/2022
AdventOfCode
AdventOfCode - Solutions to the Advent of Code 2022 puzzles.
advent - individual solutions at AoC
adventofcode - AoC solutions and visualizations for the years 2021 (Julia), 2022 (Kotlin), 2023 (Python)
aoc2021 vs AdventOfCode2021
advent-of-code vs aoc2020
aoc2021 vs aoc-2021
advent-of-code vs advent2022
aoc2021 vs advent_of_code
advent-of-code vs AdventofCode2022
aoc2021 vs Advent_of_code_2021
advent-of-code vs AdventOfCode2022
advent-of-code vs AdventOfCode
advent-of-code vs AdventOfCode
advent-of-code vs advent
advent-of-code vs adventofcode