advent-of-code-2022
AoC
advent-of-code-2022 | AoC | |
---|---|---|
8 | 87 | |
0 | 18 | |
- | - | |
10.0 | 8.1 | |
over 1 year ago | 16 days ago | |
D | Python | |
- | GNU General Public License v3.0 or later |
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.
advent-of-code-2022
-
-🎄- 2022 Day 14 Solutions -🎄-
Slow dlang solution that simulates sand drops one grain at a time, one pixel at a time. Here's the main loop for part 2. The occupied[grain] = true assignment is due to the fact that the standard library doesn't have a hashset (to my knowledge), so instead I'm putting Points in an associative array while discarding the values.
-
-🎄- 2022 Day 13 Solutions -🎄-
Dlang solution, using JSON parsing from the standard library. At first I misunderstood the problem and kept getting failures in the second pair. I thought [2,3,4] vs [4] meant that the right list will run out of items after having successfully compared 2 and 4, but then I learned that this would only happen if 2 and 4 were equal (thanks to this thread). This made me realize that a binary comparison wasn't enough and pushed me to write the convoluted ternary comparison function below :
-
-🎄- 2022 Day 12 Solutions -🎄-
Dlang solution using BFS. Relevant part :
-
-🎄- 2022 Day 11 Solutions -🎄-
Dlang solution as usual, here's the class that handles monkey business :
-
-🎄- 2022 Day 10 Solutions -🎄-
Dlang solution. For part 2 I initially thought that the X register contains values exceeding 40, so I kept appending pixels to the CRT while comparing them to the sprite, and in the end I printed the string in chunks of 40. Only later did I realize my mistake
-
-🎄- 2022 Day 9 Solutions -🎄-
Dlang bruteforce solution. For some reason I thought the rope was 9 knots long and kept getting off by one results. Relevant part 2 portion :
-
-🎄- 2022 Day 8 Solutions -🎄-
Dlang bruteforce solution
-
-🎄- 2022 Day 7 Solutions -🎄-
Dlang solution, part 2. I'm embarrassed by this code but I'm sharing it because it took a lot of effort to write it. Previous solutions are available in this repo
AoC
-
-❄️- 2023 Day 11 Solutions -❄️-
20ms both parts https://github.com/Fadi88/AoC/blob/master/2023/day11/code.py
- -❄️- 2023 Day 9 Solutions -❄️-
- -❄️- 2023 Day 8 Solutions -❄️-
- -❄️- 2023 Day 7 Solutions -❄️-
-
-❄️- 2023 Day 6 Solutions -❄️-
Same Algo as my python code from earlier, now just using math not search space reduction also blazing fast in micro seconds https://github.com/Fadi88/AoC/tree/master/2023/day06
- -❄️- 2023 Day 5 Solutions -❄️-
- [2022-day16] python port to rust performance question
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
What are some alternatives?
advent-of-code - My solutions for Advent of Code
adventofcode - Solutions for problems from AdventOfCode.com
aoc2020 - Advent of Code 2020 - my answers
AdventOfCode-Java - adventOfCode(Language.JAVA);
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
aoc2021 - Advent of Code 2021 Solutions
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
Advent-of-code-2021-golang - Advent of code 2021 Go solutions
aoc2021 - Advent of Code 2021 - my answers
Advent-of-Code - Advent of Code
advent-of-code-2021
AdventOfCode2021 - Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree: