aoc
advent_of_code
aoc | advent_of_code | |
---|---|---|
7 | 19 | |
6 | 5 | |
- | - | |
8.0 | 8.0 | |
about 2 months ago | about 2 months ago | |
Kotlin | Dart | |
MIT License | 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.
aoc
-
-🎄- 2022 Day 14 Solutions -🎄-
Very interesting. I used a hashmap (data class holding x and y coordinate as key) to keep track of if a position was rock or sand. Then I had a recursive function that found where the sand would land.
-
Advent of Code 2022 - Day 8 - Kotlin Edition
AoC by Niklas Barsk
-
-🎄- 2022 Day 5 Solutions -🎄-
My Kotlin solution have similarities with many other solutions.
-
With 350 stars earned I want to thank everyone for another great year!
In case anyone is interested my solutions, written in Kotlin, are available on Github.
-
-🎄- 2021 Day 8 Solutions -🎄-
My Kotlin solution
- I made it
-
2020 Day 19 Solutions
My Kotlin code (with a lot of comments).
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
advent-of-code
aoc2022
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:
scamp-cpu - A homebrew 16-bit CPU with a homebrew Unix-like-ish operating system.
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
aoc2022
adventofcode - Solutions for problems from AdventOfCode.com
AoC2022 - My solutions to Advent of Code 2022 [Moved to: https://github.com/d12bb/AdventOfCode]
toit - Program your microcontrollers in a fast and robust high-level language.
adventofcode - 🎄 Advent of Code
adventofcode - Advent of Code Repo for Zach Attakk