aoc2021
aoc-2021
aoc2021 | aoc-2021 | |
---|---|---|
11 | 14 | |
1 | 1 | |
- | - | |
0.0 | 0.0 | |
over 2 years ago | about 2 years ago | |
Python | Haskell | |
- | MIT License |
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 -🎄-
aoc-2021
-
Advent of Code 2021 day 25
I used two sets containing respectively the positions of the down-facing and right-facing sea cucumbers: link to solution
-
Advent of Code 2021 day 24
Solution
-
Advent of Code 2021 day 22
(full code) My solution is quite similar to this one, just to have fun I decided to use a typeclass Intersectable with an instance for both Ranges and Cuboids:
-
Advent of Code 2021 day 19
(full code)
-
Advent of Code 2021 day 16
My solution, I treated the binary input as strings of 0s and 1s instead of arrays of bools, it made the parsing easier using Parsec
-
Advent of Code 2021 day 14
I used a Map to track the occurrences of each monomer and updated it as many times as needed using the input's rules (full code here)
-
Advent of Code 2021 day 13
I solved the problem using a set of points and literally folding over it: (code here)
-
Advent of Code 2021 day 12
(Full code here) I used a map to represent the graph, basically I treated a Graph a as a Map a [a]
-
Advent of Code 2021 day 11
Any feedback is greatly appreciated! The full code for handling the matrix and the flash function is here
-
Advent of Code 2021 day 10
My solution is here
What are some alternatives?
AdventOfCode2021 - My solutions to https://adventofcode.com/2021
advent-of-code
advent_of_code - :christmas_tree: Advent of Code 2021 in Kotlin :christmas_tree:
advent-of-code-2021 - 🎅🌟❄️☃️🎄🎁
Advent_of_code_2021 - Rust solutions for advent of code 2021
aoc2021-haskell - Solving coding puzzles from https://adventofcode.com/2021/ in haskell.
aoc2021 - My Advent of Code 2021 solutions
aoc-hs - Solutions to advent of code exercises in Haskell.
aoc2021 - AoC 2021
ghc - Mirror of the Glasgow Haskell Compiler. Please submit issues and patches to GHC's Gitlab instance (https://gitlab.haskell.org/ghc/ghc). First time contributors are encouraged to get started with the newcomers info (https://gitlab.haskell.org/ghc/ghc/wikis/contributing).
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
AdventOfCode