advent-of-code-wim
AlgorithmProblems
| advent-of-code-wim | AlgorithmProblems | |
|---|---|---|
| 17 | 3 | |
| 33 | 11 | |
| - | - | |
| 8.8 | 7.1 | |
| 5 months ago | 4 months ago | |
| Python | Python | |
| Do What The F*ck You Want To Public License | - |
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-wim
-
[2023 Day 7] Better Example Input (Not a Spoiler)
Thanks for the extra example. I've added it to my CI and test suite in https://github.com/wimglenn/advent-of-code-wim/pull/89
-
-❄️- 2023 Day 7 Solutions -❄️-
Full code here
-
Running time goals (more of a survey question)
I'm using Python so I'll never be as fast as the people using Rust or C, but am still able to solve most puzzles in under 1 second (repo: https://github.com/wimglenn/advent-of-code-wim).
-
[2022 Day 14] Low budget terminal vis of the example data
Thanks for the kind words, well the source is here so you can just take a look. You have to run with var AOC_DEBUG=1 in env to enable the rendering.
-
[2022 Day 12] Is there any A* heuristic which makes things better, not worse?
I used an AStar pathfinder already prepared from earlier years (aoc2022/q12.py), just leaving the default null heuristic. If I understand correctly that is just a BFS.
-
[2022 Day 10] AoC OCR
https://github.com/wimglenn/advent-of-code-wim/blob/main/aoc_wim/ocr.py has nearly all the letters we've seen (including a larger font used once in 2018) although it is missing the 5-wide Y that was in my 2016-day 08 puzzle
-
-🎄- 2022 Day 7 Solutions -🎄-
By the way, I found that if you're willing to use pathlib and a guard, you actually only need 2 of those 6 case statements - it looks like this.
-
-🎄- 2022 Day 5 Solutions -🎄-
Python (repo). I was particularly pleased with how quick the parsing was.
-
-🎄- 2021 Day 13 Solutions -🎄-
Python + "AOCR" + complex numbers.
-
-🎄- 2021 Day 9 Solutions -🎄-
Python
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
What are some alternatives?
adventofcode
competitive_programming - My solutions to programming contest problems from different sources (UVa, TopCoder, Live Archive, SPOJ, etc).
AdventOfCode2022 - Repository for advent of code code to find solutions. This year in Go.
advent-of-code - Collection of JS solutions for puzzles from adventofcode.com 🎁🎄
advent-of-code
Advent-of-Code - My solutions or attempts at solutions to the Advent of Code event.
advent-of-code - Advent of Code 2022
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.
advent-of-code - Advent of Code with JS
AoC - my personal repo for the advent of code yearly challenge
adventofcode_2022
Advent-Of-Code