AoC2021
advent_of_code
AoC2021 | advent_of_code | |
---|---|---|
11 | 19 | |
3 | 5 | |
- | - | |
0.0 | 8.0 | |
over 2 years ago | 3 months ago | |
F# | 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.
AoC2021
-
-🎄- 2021 Day 25 Solutions -🎄-
Interesting approach. I did away with a recursive function, Array.transpose and a bit of copypasta ...
-
Advent of Code day 12 advise
I think my solution should be easy to understand - (you can ignore the getEdges for now, it's just a function that generates a Map of -> )
-
-🎄- 2021 Day 17 Solutions -🎄-
F#
-
[2021 Day 16 (Part 2) F# Trouble with the last example
Any help appreciated, current (spaghetti) code is in my GitHub
-
-🎄- 2021 Day 14 Solutions -🎄-
In the end it turned out pretty nice
-
-🎄- 2021 Day 12 Solutions -🎄-
So pretty compared to my spaghetti
-
-🎄- 2021 Day 9 Solutions -🎄-
So much more elegant than my solution
-
-🎄- 2021 Day 7 Solutions -🎄-
Your solution is so much cleaner than mine
-
-🎄- 2021 Day 2 Solutions -🎄-
+1, Quite similar to my solution
-
-🎄- 2021 Day 1 Solutions -🎄-
Here is link number 1 - Previous text "F#"
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?
MoreLINQ - Extensions to LINQ to Objects
advent-of-code
advent-of-code-jq - Solving Advent of Code with jq
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:
Advent-of-Code-2021 - Did somebody say Shakespeare Programming Language?
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
adventlang - 🎅 A programming language (+ code playground) for Advent of Code.
adventofcode - Solutions for problems from AdventOfCode.com
AdventofCode2021
toit - Program your microcontrollers in a fast and robust high-level language.
deno_aoc - 🎄 Advent of code solutions written in TypeScript for Deno.
adventofcode - Advent of Code Repo for Zach Attakk