AoC2021
Advent of Code 2021 (by EragonpeerGynt)
advent_of_code
Solutions to programming puzzles on Advent of Code (by Praful)
AoC2021 | advent_of_code | |
---|---|---|
4 | 19 | |
0 | 5 | |
- | - | |
0.0 | 8.0 | |
over 2 years ago | about 2 months ago | |
Elixir | Dart | |
MIT License | GNU General Public License v3.0 only |
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 2021-12-15.
-
Need help with code efficiency (day 15 AoC, part 1 and 2)
Disclaimer: I am learning Elixir this year trough AoC so code quality is in a shape that could find a place on r/programinghorror I would like to ask with help optimising algorithm I made for solving today's (day 15, 2021) Advent of Code problem. I implemented Dijkstra's (I think) and first part already need 35+ seconds to get the resautls. This is the code I made but I don't know how to optimize it (Maps probably aren't the most efficient thing to use in code that goes that far into recursion), to reach some more normal execution times. I would like to not use 3rd party/external libraries if possible, but any help is appriciated.
-
-🎄- 2021 Day 10 Solutions -🎄-
Elixir Quite a fun little exercise today. Code is still ugly as death, but I finally feal like I can enjoy the language freely. On other note, how could I solve the problem with me having to push char at the amstart of array without overloading process_line/2 ? (Line 5)
-
-🎄- 2021 Day 7 Solutions -🎄-
elixir Probably not very efficient and quite ugly. But it works... If anyone has any sugestions how to make it better (how to become better @elixir) i would greatly appriciate it
-
-🎄- 2021 Day 3 Solutions -🎄-
My solution in elixir (github link) It's not the cleanest fastest solution probably but does the job well enough. Still fighting with language a bit and forgeting some things in it sometimes (first time using it)
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-08.
-
-❄️- 2023 Day 9 Solutions -❄️-
Here's the relevant extract from my (recursive) solution. Full code on GitHub.
-
-❄️- 2023 Day 8 Solutions -❄️-
Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.
-
-🎄- 2022 Day 14 Solutions -🎄-
Solutions to parts 1 and 2 nearly identical and pretty much worked first time. Nothing clever here. This was far simpler than I thought it would be. I probably spent most time trying to think of a mathematical way of getting all points between p1 and p2. In the end, I just constructed two ranges. Full code here.
-
-🎄- 2022 Day 10 Solutions -🎄-
Full code on github.
-
-🎄- 2022 Day 9 Solutions -🎄-
The core of my solution below using numpy (because I'm learning it!). See github for full code.
-
-🎄- 2022 Day 8 Solutions -🎄-
Python 3 solution using numpy. I got held up because I assume (but know better) that numpy arrays are [x,y] instead of [row, col], which is [y,x].
-
-🎄- 2021 Day 14 Solutions -🎄-
Below is the new solution, which works for part 1 and 2. The full code is on GitHub.
-
-🎄- 2021 Day 11 Solutions -🎄-
These are the key functions. The whole code is on GitHub
-
-🎄- 2021 Day 9 Solutions -🎄-
Part 2 (extract shown below) was a matter of starting with the low points found in part 1 then recursively looking around for relevant points. Full code on GitHub
-
-🎄- 2021 Day 8 Solutions -🎄-
Code is on GitHub.