adventofcode
aoc
adventofcode | aoc | |
---|---|---|
11 | 22 | |
8 | 1 | |
- | - | |
8.9 | 9.0 | |
3 months ago | 4 months ago | |
Rust | Raku | |
- | MIT 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.
adventofcode
-
[2021 Day 6 (Part 2)] [Rust] Pretty darn elegant
This lets you cut out the relatively expensive fcount.remove(0) operation, and each loop is basically one addition and a few assignments. Full solution here.
-
-🎄- 2022 Day 13 Solutions -🎄-
Code
- -🎄- 2022 Day 12 Solutions -🎄-
-
Advent of Code: Day 3
Your solution is pretty much exactly the super concise version of my definitely over-engineered solution.
-
[2022 Day 2] Data structures good control flow bad!!!
You can see the code here
-
AOC Day 2
Here's my solution
-
[2015 day 04][Zig] Some tips to solve the problem without brute force?
Your solution looks remarkably similar to my Rust solution which solves both parts in 1.6s on the cheap NUC I use as my coding workstation.
-
2020 Day 8.2 in Python - trying to figure out how to do this efficiently?
It's in Rust, so I'm not sure how readable you'll find it, but in case it helps, you can see the code here.
-
Programing midlife "crysis"
I found a single crate with a bunch of binaries worked well. It let me use a shared library easily. You can see my crate organization here if that's helpful.
-
2020 day 7 (part 2) How would you solve this without recursion?
You can see my code here in case it helps.
aoc
- -❄️- 2023 Day 10 Solutions -❄️-
-
-❄️- 2023 Day 9 Solutions -❄️-
Full code at GitHub.
-
-❄️- 2023 Day 7 Solutions -❄️-
Edit: you don't need to determine the type of hand, but you can directly compare the card counts. Second version @GitHub.
-
-🎄- 2022 Day 13 Solutions -🎄-
New version @GitHub.
-
-🎄- 2022 Day 12 Solutions -🎄-
So, a new version with a lot less almost-duplicate code @GitHub.
- -🎄- 2022 Day 2 Solutions -🎄-
-
-🎄- 2022 Day 1 Solutions -🎄-
@GitHub
-
-🎄- 2021 Day 21 Solutions -🎄-
Completed part 2, see GitHub. I couldn't really use the same `DiracDice` class and simply use another `Die`, but had to create a separate `DiracDice2` class.Basically, just keep track of the possible universe state and their counts, and try all possible combinations of die rolls. Keep playing until all universes have a winner.
-
-🎄- 2021 Day 20 Solutions -🎄-
The rest is the same as my first attempt, but full code at GitHub.
-
-🎄- 2021 Day 18 Solutions -🎄-
I spent way too much time on this, but I completed my original attempt with the proper object model, see GitHub
What are some alternatives?
adventofcode.sh - Advent of Code 2020 and 2015, done in bash. Because why not?
rockstar - The Rockstar programming language specification
advent - Advent of Code - Ada
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
advent-of-code-golf-2020 - doing the same thing over and over and expecting the same results
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
advent - Solving Advent of Code problems. See https://adventofcode.com/
adventofcode - Advent of code solutions
AdventOfCode2022
advent-of-code-2021 - zig solutions to advent of code 2021
advent-of-code-2020 - Solutions of Advent of Code 2020
Advent-of-Code - Advent of Code