AoC
advent-of-code
Our great sponsors
AoC | advent-of-code | |
---|---|---|
87 | 34 | |
18 | 29 | |
- | - | |
8.3 | 5.6 | |
4 months ago | 4 months ago | |
Python | 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.
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 -🎄-
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?
advent-of-code - My solutions for Advent of Code
AdventOfCode.Template - Advent of Code C# (.NET 8) template. Based on AoCHelper (https://github.com/eduherminio/AoCHelper)
adventofcode - Solutions for problems from AdventOfCode.com
tqdm - :zap: A Fast, Extensible Progress Bar for Python and CLI
aoc2020 - Advent of Code 2020 - my answers
advent-of-code-2022 - advent of code 2022
AdventOfCode-Java - adventOfCode(Language.JAVA);
advent_of_code
advent-of-code-go - All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
slushy - Advent of Code 2022 in Rust
aoc2021 - Advent of Code 2021 Solutions
LEARN__Coding-Practices-and-Datastructures - Daily Coding Practices, Data structures, otherwise testing and some stuff. (Some garbage/some stuff)