advent-of-code
adventofcode
advent-of-code | adventofcode | |
---|---|---|
34 | 55 | |
29 | 20 | |
- | - | |
5.6 | 7.8 | |
5 months ago | 5 months ago | |
Python | Elixir | |
- | - |
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
-
-❄️- 2023 Day 11 Solutions -❄️-
[LANGUAGE: Python 3] 153/75 Raw solution
-
-❄️- 2023 Day 10 Solutions -❄️-
One could instead count |F7 (that's what I do in my refactored solution), but counting all the bends would miscount the vertical segments (FJ would end up canceling itself out).
-
-❄️- 2023 Day 8 Solutions -❄️-
That sounds like what I suggested here, actually. I don't have anything in my library with quite the right API yet, but I already have most of what you describe coded out. (It looks like I whipped it up for 2017 Day 13.)
-
-❄️- 2023 Day 7 Solutions -❄️-
[LANGUAGE: Python 3] Embarrassing/Embarrassing Ugly raw solution code
-
-❄️- 2023 Day 6 Solutions -❄️-
[LANGUAGE: Python 3] 66/101 Raw solution code
-
-🎄- 2022 Day 22 Solutions -🎄-
Python 3 21/12
-
-🎄- 2022 Day 20 Solutions -🎄-
It doesn't, but you can use a separate list, wrapper classes, and deque.index to find where the values live. I may be biased but I think that my solution (ultimately using deque) isn't as complex as a custom linked list.
-
-🎄- 2022 Day 19 Solutions -🎄-
Part 2 assumes you did part 1 properly. I did not! I'm pretty sure that the intended solution is to do a sort of reverse search (have a target number of geodes and work backwards to see if that's possible to achieve) but I was just not having success coming up with a way to do that. It's probably going to be blindingly obvious once I figure it out, but that might be an exercise for tomorrow.
-
-🎄- 2022 Day 15 Solutions -🎄-
Python 3 9/15!!!
-
-🎄- 2022 Day 14 Solutions -🎄-
Python 3 44/45
adventofcode
-
-❄️- 2023 Day 10 Solutions -❄️-
Part one went fairly fast, but spent quite some time on getting part two right. I settled on the approach of just iterating over the grid and using a boolean to see if I had to count elements or not. However, I had some issues figuring out when to swap, this post by /u/rogual helped me figure it out. After that I lost quite some time on an error that only occurred with my input, not with the example input. It turned out that my loop (which I take form my p1 solution) didn't include the start node, which caused all sorts of counting issues.
-
-❄️- 2023 Day 4 Solutions -❄️-
[Language: Elixir] https://github.com/mathsaey/adventofcode/blob/master/lib/2023/4.ex
- -🎄- 2022 Day 25 Solutions -🎄-
- -🎄- 2022 Day 24 Solutions -🎄-
- -🎄- 2022 Day 23 Solutions -🎄-
- -🎄- 2022 Day 22 Solutions -🎄-
- -🎄- 2022 Day 21 Solutions -🎄-
- -🎄- 2022 Day 20 Solutions -🎄-
- -🎄- 2022 Day 19 Solutions -🎄-
- -🎄- 2022 Day 18 Solutions -🎄-
What are some alternatives?
AdventOfCode.Template - Advent of Code C# (.NET 8) template. Based on AoCHelper (https://github.com/eduherminio/AoCHelper)
AdventOfCode2021 - Advent of code 2021
tqdm - :zap: A Fast, Extensible Progress Bar for Python and CLI
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent-of-code-2022 - advent of code 2022
adventofcode - Answers to Advent of Code
advent_of_code
aoc2021 - Advent of Code 2021 - my answers
slushy - Advent of Code 2022 in Rust
rockstar - The Rockstar programming language specification
LEARN__Coding-Practices-and-Datastructures - Daily Coding Practices, Data structures, otherwise testing and some stuff. (Some garbage/some stuff)
roast - 🦋 Raku test suite