AlgorithmProblems
advent-of-code
AlgorithmProblems | advent-of-code | |
---|---|---|
3 | 34 | |
11 | 29 | |
- | - | |
7.1 | 5.6 | |
4 months ago | 4 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.
AlgorithmProblems
-
-🎄- 2022 Day 12 Solutions -🎄-
github link
- -🎄- 2022 Day 11 Solutions -🎄-
-
-🎄- 2021 Day 9 Solutions -🎄-
Did a recursive DFS to solve part 2. github code
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
What are some alternatives?
competitive_programming - My solutions to programming contest problems from different sources (UVa, TopCoder, Live Archive, SPOJ, etc).
AdventOfCode.Template - Advent of Code C# (.NET 8) template. Based on AoCHelper (https://github.com/eduherminio/AoCHelper)
advent-of-code - Collection of JS solutions for puzzles from adventofcode.com 🎁🎄
tqdm - :zap: A Fast, Extensible Progress Bar for Python and CLI
Advent-of-Code - My solutions or attempts at solutions to the Advent of Code event.
advent-of-code-2022 - advent of code 2022
advent-of-code-wim - Wim's solutions for https://adventofcode.com/ puzzles
advent_of_code
advent-of-code - My Advent of Code submissions. For 2021 and before, these are the original code I used, without any modifications after-the-fact. As such, they are probably not as efficient or short as they should be, because I want a working solution faster, not a better solution. For 2022 and after, these are the solutions uploaded to my YouTube channel.
slushy - Advent of Code 2022 in Rust
AoC - my personal repo for the advent of code yearly challenge
LEARN__Coding-Practices-and-Datastructures - Daily Coding Practices, Data structures, otherwise testing and some stuff. (Some garbage/some stuff)