aoc-2023-in-kotlin
Aoc 2023 in Kotlin! (by ritesh-singh)
Advent_Of_Code
My solution for the Advent of Code challenges in various languages. (by Dullstar)
aoc-2023-in-kotlin | Advent_Of_Code | |
---|---|---|
1 | 14 | |
0 | 0 | |
- | - | |
7.8 | 8.1 | |
5 months ago | 4 months ago | |
Kotlin | Python | |
- | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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-2023-in-kotlin
Posts with mentions or reviews of aoc-2023-in-kotlin.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-05.
Advent_Of_Code
Posts with mentions or reviews of Advent_Of_Code.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-09.
- -❄️- 2023 Day 10 Solutions -❄️-
- -❄️- 2023 Day 9 Solutions -❄️-
- -❄️- 2023 Day 8 Solutions -❄️-
- -❄️- 2023 Day 7 Solutions -❄️-
- -❄️- 2023 Day 6 Solutions -❄️-
- -❄️- 2023 Day 5 Solutions -❄️-
- -❄️- 2023 Day 4 Solutions -❄️-
-
-🎄- 2022 Day 17 Solutions -🎄-
Python, for part 1.
-
-🎄- 2022 Day 12 Solutions -🎄-
Comes with a free simple visualization of path lengths because I made it for debugging purposes and I thought it was actually pretty interesting. The end point has a value of 000, and you can follow the path there from anywhere on the map by going to a space with the next lowest number, i.e. starting at 010 -> 009 -> 008 -> 007... etc. Spaces with --- cannot reach the end point.
-
-🎄- 2021 Day 21 Solutions -🎄-
C++