advent-of-code
advent-of-code | advent_of_code | |
---|---|---|
4 | 11 | |
1 | 3 | |
- | - | |
8.6 | 8.1 | |
4 months ago | 5 months ago | |
Python | Rust | |
- | - |
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
-
-βοΈ- 2023 Day 6 Solutions -βοΈ-
github
-
-π- 2022 Day 21 Solutions -π-
python using z3
-
-π- 2022 Day 15 Solutions -π-
python3
-
Advent of Code 2021 using SQL (PostgreSQL-flavored)
Heh I wondered the same thing, but the README says he may not complete every challenge. I actually did the first problem in SQL, and learned a bit about window functions and bounding the range it covers:
https://github.com/jarshwah/advent-of-code/blob/main/sql/202...
Though now I know you can ignore the window and just compare against the 3rd offset, the first solution just needs a `LEAD(depth, 3)` to complete the second question.
Still - I learned about `RANGE BETWEEN` so I'm calling it a win.
advent_of_code
-
-βοΈ- 2023 Day 6 Solutions -βοΈ-
Just solved it analytically on paper and then implemented the equation because I didn't have a proper calculator at hand. Honestly though, even just using the builtin MacOS calculator would've been faster in the end...
-
-π- 2022 Day 24 Solutions -π-
Yeah, it's what I thought too. But frankly, it took me all day to get this much out of my fogged brain, so I took the win I got.
-
-π- 2022 Day 22 Solutions -π-
Even though I had the visual aid I needed to go over the entire thing like 4 times and double check all the wraps that actually occur to make sure it's actually correct. Not difficult, just really tiring and tedious. Anyway, because it was asked for, here are the sketches I made while figuring it out.
-
-π- 2022 Day 18 Solutions -π-
Haskell
-
-π- 2022 Day 15 Solutions -π-
Haskell (Realistically only part 1)
-
-π- 2022 Day 9 Solutions -π-
Had part 1 almost first try, and then struggled a bit understanding part 2 correctly. Once I did, it wasn't too bad to adjust what I had to work with any number of knots, only thing that tripped me up for a bit was that I was missing the outer corners for "updateTail" as they can't happen in part 1, but will happen in part 2.
-
-π- 2021 Day 22 Solutions -π-
Haskell (Part 1 only)
-
[Day 21, Part 2] [Haskell, but badly] I only get the correct number of wins for losing player?
Code here, does anyone maybe have an idea what's going wrong?
-
[2021, Day 19][Haskell] Why are some scanners not overlapping with any others?
Can anyone give me an indicator where I'm going wrong? Code here, but it's basically unreadable, so I'm not sure if that's gonna be much of a help. I can say that it correctly enables me to deduce the position of scanner 1 relative to scanner 0 from the example, so I must be doing something sort of right.
-
-π- 2021 Day 1 Solutions -π-
Haskell
What are some alternatives?
advent-2021-sql - Advent of Code 2021 using SQL (PostgreSQL-flavored)
aoc-factor - Advent of Code solutions in Factor
aoc2022
advent-of-code - Polyglot Advent of Code solution collection
slushy - Advent of Code 2022 in Rust
AdventOfCode
adventofcode
Advent-of-Code - My solutions for Advent of Code challenges - https://adventofcode.com/
advent-of-code
AdventOfCode2022 - LΓΆsungen fΓΌr Advent of Code 2022 https://adventofcode.com/2022
advent-of-code-2022 - Advent of Code 2022 in Javascript
advent-of-code - My solutions for Advent of Code, written in Go