adventofcode
advent_of_code
adventofcode | advent_of_code | |
---|---|---|
14 | 19 | |
4 | 5 | |
- | - | |
6.6 | 8.0 | |
5 months ago | about 2 months ago | |
Python | Dart | |
- | GNU General Public License v3.0 only |
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
-
-❄️- 2023 Day 4 Solutions -❄️-
[Language: Go] solution (Both Parts)
-
[2022 10 # (Part 2)] [Python] Looking for a hint
Glad to hear that. If you want an example.of what I wrote here is my code, I did 2 versione dictionary and list. repo
-
[2022 9 Part 2][Python 3.11] Works with Part 1 and larger test data but solution isn't correct
This is my code: link
-
[2022 Day 7][Python3.11] Tree reader works test data but not on the puzzle
I used a dict. Find the whole solution here
-
-🎄- 2022 Day 8 Solutions -🎄-
Python 3.11 Recursive functions with backtracking: full implementation here
-
-🎄- 2022 Day 6 Solutions -🎄-
Python 3.11 solution quite simple, basic list manipulation
-
-🎄- 2021 Day 8 Solutions -🎄-
Python 3.8 solution damn it took me 3 days to complete the part 2 for stupid attention error. Figuring out that counting letters in the sequence diagram was a huuuuge leap forward. Also sorting the letters.
-
-🎄- 2021 Day 7 Solutions -🎄-
Python 3.8 solution
-
[day5 part2][python] Failing to get the second part
This is the code please help
-
-🎄- 2021 Day 5 Solutions -🎄-
Python 3.8 solution This was difficult, I debugged for 2 hours to find out I wasn' counting the first time I encountered a diagonal... However I'm sattisfied, this is pretty quick
advent_of_code
-
-❄️- 2023 Day 9 Solutions -❄️-
Here's the relevant extract from my (recursive) solution. Full code on GitHub.
-
-❄️- 2023 Day 8 Solutions -❄️-
Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.
-
-🎄- 2022 Day 14 Solutions -🎄-
Solutions to parts 1 and 2 nearly identical and pretty much worked first time. Nothing clever here. This was far simpler than I thought it would be. I probably spent most time trying to think of a mathematical way of getting all points between p1 and p2. In the end, I just constructed two ranges. Full code here.
-
-🎄- 2022 Day 10 Solutions -🎄-
Full code on github.
-
-🎄- 2022 Day 9 Solutions -🎄-
The core of my solution below using numpy (because I'm learning it!). See github for full code.
-
-🎄- 2022 Day 8 Solutions -🎄-
Python 3 solution using numpy. I got held up because I assume (but know better) that numpy arrays are [x,y] instead of [row, col], which is [y,x].
-
-🎄- 2021 Day 14 Solutions -🎄-
Below is the new solution, which works for part 1 and 2. The full code is on GitHub.
-
-🎄- 2021 Day 11 Solutions -🎄-
These are the key functions. The whole code is on GitHub
-
-🎄- 2021 Day 9 Solutions -🎄-
Part 2 (extract shown below) was a matter of starting with the low points found in part 1 then recursively looking around for relevant points. Full code on GitHub
-
-🎄- 2021 Day 8 Solutions -🎄-
Code is on GitHub.
What are some alternatives?
Advent-of-Code-2023
advent-of-code
advent-of-code
AdventOfCode2021 - Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree:
AdventOfCode2021 - Advent of code 2021
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
advent-of-code
adventofcode - Solutions for problems from AdventOfCode.com
aoc2021 - Advent of Code 2021 Solutions
toit - Program your microcontrollers in a fast and robust high-level language.
Advent_of_Code_2023 - My attempt for Advent of Code 2023. Will try in Python first, Rust if/when I have time.
adventofcode - Advent of Code Repo for Zach Attakk