AdventOfCode
Advent-of-Code
AdventOfCode | Advent-of-Code | |
---|---|---|
15 | 42 | |
2 | 9 | |
- | - | |
0.0 | 8.6 | |
over 1 year 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.
AdventOfCode
-
-🎄- 2022 Day 24 Solutions -🎄-
Just a basic BFS. My part 2 ran in 1.77 seconds.
-
-🎄- 2022 Day 19 Solutions -🎄-
Here's my solution. It's a bit of a janky script.
-
-🎄- 2022 Day 17 Solutions -🎄-
Yet another Python solution to part 2. My Python code isn't the best but I haven't seen many solutions that detect cycles programmatically.
-
-🎄- 2022 Day 16 Solutions -🎄-
There's nothing particularly nice about my Python solution but in case anyone's interested here it is. I find all points' shortest paths using floodfill and a loop because I couldn't recall Floyd-Warshall. And then it's a DFS, branching every turn when the human or elephant can make a choice to move to another valve and open it. Debugging was tricky.
-
-🎄- 2022 Day 5 Solutions -🎄-
You can check my solutions from last year https://github.com/WilliamLP/AdventOfCode/tree/master/2021 I made it up to day 14 / 17 and used that WITH RECURSIVE / UNNEST / ARRAY_AGG pattern a lot.
- -🎄- 2021 Day 24 Solutions -🎄-
- -🎄- 2021 Day 23 Solutions -🎄-
- -🎄- 2021 Day 22 Solutions -🎄-
-
-🎄- 2021 Day 19 Solutions -🎄-
I got there, but math! It took a few hours, more along the lines of a weekend project than a quick puzzle! The hardest part is working with the 24 orientations I think. I needed to dust off a little bit of linear algebra and used matrices. There are 6 permutations of the 3 coordinates, and 8 flips (+- on each axis). Composing those gives 48 transformations but half of them are the wrong chirality (mirror image) so we want only the half with determinant equal one. After that it's just a bunch of picky loops and debugging. https://github.com/WilliamLP/AdventOfCode/blob/master/2021/day19.py
- -🎄- 2021 Day 14 Solutions -🎄-
Advent-of-Code
-
-❄️- 2023 Day 11 Solutions -❄️-
Fun one :D
-
-❄️- 2023 Day 10 Solutions -❄️-
Way trickier than I was expecting
-
-❄️- 2023 Day 9 Solutions -❄️-
:D
-
-❄️- 2023 Day 8 Solutions -❄️-
Classic LCM
-
-❄️- 2023 Day 7 Solutions -❄️-
Who wants spaghetti?
-
-❄️- 2023 Day 6 Solutions -❄️-
Much easier than yesterday's :D
-
-🎄- 2022 Day 12 Solutions -🎄-
195/242
-
-🎄- 2022 Day 11 Solutions -🎄-
Messy. Thankfully got part two pretty quickly recognizing that we can mod the worry level by the product of the test integers. Might refactor / clean this up tomorrow morning
-
-🎄- 2022 Day 10 Solutions -🎄-
2343 / 2119
-
-🎄- 2022 Day 6 Solutions -🎄-
Impressive how fast everyone was with this one today
What are some alternatives?
advent-2021-sql - Advent of Code 2021 using SQL (PostgreSQL-flavored)
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
adventofcode - my solutions to advent of code
AdventOfCode-Java - adventOfCode(Language.JAVA);
adventofcode - my solutions to the adventofcode.com puzzles
AoC - my personal repo for the advent of code yearly challenge
adventofcode
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
advent-of-raku-2022 - 2022 Advent of Code solutions in the Raku programming language
adventofcode - Solutions for problems from AdventOfCode.com
aoc2022 - Advent of Code 2022
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA