adventofcode
aoc
adventofcode | aoc | |
---|---|---|
5 | 22 | |
6 | 1 | |
- | - | |
9.1 | 9.0 | |
about 1 month ago | 4 months ago | |
HTML | 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
-
Advent of Code 2023 is nigh
I disagree on it being "overthinking". I just did it without thinking. Saw that it failed on the "eightwo" case since "two" got replaced first, so just replaced "two" with "two2two" instead, then passed it through solver for part1. To me that's simpler and more naive than correctly writing a search or backwards-forwards regex :)
My solution in Kotlin https://github.com/kolonialno/adventofcode/commit/686cbebb07...
-
-🎄- 2022 Day 13 Solutions -🎄-
Full code here: https://github.com/kolonialno/adventofcode/commit/13c09d85a322a4ca3f8901fa58119f46cbf45a2c
-
-🎄- 2021 Day 21 Solutions -🎄-
This is my fast and final approach btw https://github.com/kolonialno/adventofcode/blob/main/matsemann/Day21.kt
- -🎄- 2021 Day 18 Solutions -🎄-
- -🎄- 2021 Day 8 Solutions -🎄-
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?
AdventOfCode2021 - Advent of code 2021
rockstar - The Rockstar programming language specification
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent-2021 - [Moved to: https://github.com/Crazytieguy/advent-of-code]
kino_aoc - A helper for Advent of Code (a smart cell) for Elixir Livebook
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventofcode - :christmas_tree: Advent of Code (2015-2023) in C#
adventofcode - Advent of code solutions
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
advent-of-code-2021 - zig solutions to advent of code 2021
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
Advent-of-Code - Advent of Code