advent-of-code-kotlin
advent_of_code
advent-of-code-kotlin | advent_of_code | |
---|---|---|
12 | 19 | |
0 | 5 | |
- | - | |
1.8 | 8.0 | |
over 2 years ago | about 2 months ago | |
Kotlin | 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.
advent-of-code-kotlin
-
-🎄- 2021 Day 11 Solutions -🎄-
Kotlin solution (part 1 and part 2 merged)
-
-🎄- 2021 Day 9 Solutions -🎄-
Kotlin solution, probably not the most efficient but does the job.
-
-🎄- 2021 Day 7 Solutions -🎄-
Kotlin solution for day 7, can be done fairly concisely:
-
-🎄- 2021 Day 6 Solutions -🎄-
Kotlin solution using a fish counter map:
-
Advent of Code in Kotlin: Day 5, 2021
Day 3 — a few key concepts used are: extensions for example on List type higher-order functions aka a function which takes other functions as parameters
-
-🎄- 2021 Day 5 Solutions -🎄-
Nice! here is my solution also in Kotlin
- -🎄- 2021 Day 4 Solutions -🎄-
-
-🎄- 2021 Day 3 Solutions -🎄-
Kotlin solution for day 3, not the most concise nor most optimized but gets the job done and fairly readable.
-
-🎄- 2021 Day 2 Solutions -🎄-
Kotlin, solution for part 1 and 2 — not super concise but a few cool concepts if you're learning the language.
-
Advent of Code in Kotlin: Day 1
You can find the source code for my solution here.
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?
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
advent-of-code
aoc2021 - Advent of code 2021 solutions, in varied languages
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:
tqdm - :zap: A Fast, Extensible Progress Bar for Python and CLI
advent2021 - Advent of Code 2021 in Rust
adventofcode - Solutions for problems from AdventOfCode.com
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
toit - Program your microcontrollers in a fast and robust high-level language.
Advent-of-code-2021-golang - Advent of code 2021 Go solutions
adventofcode - Advent of Code Repo for Zach Attakk