advent-of-code-2021
advent_of_code
advent-of-code-2021 | advent_of_code | |
---|---|---|
3 | 19 | |
43 | 5 | |
- | - | |
0.0 | 8.0 | |
over 2 years ago | 2 months ago | |
Haskell | Dart | |
BSD 3-clause "New" or "Revised" 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.
advent-of-code-2021
-
All years, all days, everything in Haskell
I've done every year in Haskell (2015 2016 2017 2018 2019 2020 2021), and so have several other people such as /u/glguy. I don't see if /u/mstksg has anything published for 2015 but they've done 2016 2017 2018 2019 2020 2021 along with some pretty good writeups, I recommend checking those out.
-
-🎄- 2021 Day 2 Solutions -🎄-
Again this year I am posting my reflections for solving all of these in Haskell https://github.com/mstksg/advent-of-code-2021/blob/master/reflections.md :)
-
-🎄- 2021 Day 1 Solutions -🎄-
Like every year, i have my haskell solutions and reflections every day here :) https://github.com/mstksg/advent-of-code-2021
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
advent-of-code
aoc-2021 - AOC challenge in Haskell
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 - My solutions for the Advent of Code quests.
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
advent-of-code-2018 - Advent of Code 2018 Solutions (Spoilers!)
adventofcode - Solutions for problems from AdventOfCode.com
aoc-haskell-template - Advent of Code template for Haskell
toit - Program your microcontrollers in a fast and robust high-level language.
adventofcode - Advent of code solutions
adventofcode - Advent of Code Repo for Zach Attakk