aoc2021
Advent-of-Code
aoc2021 | Advent-of-Code | |
---|---|---|
11 | 42 | |
1 | 9 | |
- | - | |
0.0 | 8.6 | |
over 2 years ago | 5 months ago | |
Python | Python | |
- | - |
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
-
[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
-
-❄️- 2023 Day 11 Solutions -❄️-
Fun one :D
-
-❄️- 2023 Day 10 Solutions -❄️-
Way trickier than I was expecting
-
-❄️- 2023 Day 9 Solutions -❄️-
:D
-
-❄️- 2023 Day 8 Solutions -❄️-
Classic LCM
-
-❄️- 2023 Day 7 Solutions -❄️-
Who wants spaghetti?
-
-❄️- 2023 Day 6 Solutions -❄️-
Much easier than yesterday's :D
-
-🎄- 2022 Day 12 Solutions -🎄-
195/242
-
-🎄- 2022 Day 11 Solutions -🎄-
Messy. Thankfully got part two pretty quickly recognizing that we can mod the worry level by the product of the test integers. Might refactor / clean this up tomorrow morning
-
-🎄- 2022 Day 10 Solutions -🎄-
2343 / 2119
-
-🎄- 2022 Day 6 Solutions -🎄-
Impressive how fast everyone was with this one today
What are some alternatives?
AdventOfCode2021 - My solutions to https://adventofcode.com/2021
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
aoc-2021 - AOC challenge in Haskell
AdventOfCode-Java - adventOfCode(Language.JAVA);
advent_of_code - :christmas_tree: Advent of Code 2021 in Kotlin :christmas_tree:
AoC - my personal repo for the advent of code yearly challenge
Advent_of_code_2021 - Rust solutions for advent of code 2021
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
adventofcode - Solutions for problems from AdventOfCode.com
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
aoc2020 - Advent of Code 2020 - my answers
advent-of-code-2021 - 🎅🌟❄️☃️🎄🎁