advent-of-code
advent_of_code
advent-of-code | advent_of_code | |
---|---|---|
19 | 19 | |
19 | 5 | |
- | - | |
9.2 | 8.0 | |
4 months ago | about 2 months ago | |
Go | 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
- -❄️- 2023 Day 10 Solutions -❄️-
- -❄️- 2023 Day 9 Solutions -❄️-
- -❄️- 2023 Day 7 Solutions -❄️-
-
-❄️- 2023 Day 4 Solutions -❄️-
[LANGUAGE: Golang] https://github.com/pemoreau/advent-of-code/blob/main/go/2023/04/day04.go
-
Code review welcome
I have written this code but I have the feeling that it could be improved to become more idomatic, in particular I have the feeling I do use enough the notion of reference such that there are too many clones and dereferencing.
- [2022 Day 1 -17] [Go] Runtime so far for day 1-17 is .5 seconds. How does this compare?
- -🎄- 2022 Day 11 Solutions -🎄-
-
-🎄- 2022 Day 9 Solutions -🎄-
Solution in go: day09.go
-
-🎄- 2022 Day 3 Solutions -🎄-
day03.go
-
Any tips for writing performant Rust during AoC?
Thanks. Yes all my code is available here: https://github.com/pemoreau/advent-of-code
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?
adventOfCode2023 - Advent of Code 2023 Solutions in Golang
advent-of-code
advent - Learning Go with Adventofcode
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:
adventofcode - My solutions for Advent of Code AoC 2015 2016 2017 2018 2019 2020 2021 2022 2023
AdventOfCode - My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
AdventOfCode
adventofcode - Solutions for problems from AdventOfCode.com
advent-of-code - :santa: :christmas_tree: :snowman: http://adventofcode.com/ solutions
toit - Program your microcontrollers in a fast and robust high-level language.
Advent_of_Code_2023
adventofcode - Advent of Code Repo for Zach Attakk