aoc
Advent-of-Code
aoc | Advent-of-Code | |
---|---|---|
4 | 14 | |
2 | 11 | |
- | - | |
8.2 | 7.8 | |
4 months ago | 4 months ago | |
Go | C# | |
MIT License | MIT License |
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
-
Y'all are getting way too excited
Using Dijkstra and starting from `z` the solution was 2x faster than BFS in my case. By starting from `z` it constraint is that you can go to a neighbor only if the height difference is 1, that is faster than starting from `a`. For the priority I used that the amount of steps from the start to the current node inspected, meaning the nodes with shortest paths are inspected first. I counted the number of cycles (each time an element is popped out the queue) For part 1 I get ~5000 cycles with Dijkstra and ~8000 with BFS. Cannot see if there is something wrong with my BFS implementation Solution in Go
-
-π- 2022 Day 7 Solutions -π-
Go
-
-π- 2022 Day 5 Solutions -π-
Go solution abusing of slices
-
Advent of code: Rust, Go, and Binary operators
Hi everyone, I got late into the advent of code problems and currently I'm solving day 3 and 4. I've been writing my solutions in rust and go (see my aoc repo), and today, while solving day 03 I came across with an interesting comparison between rust and go code that I'd like to share in this post.
Advent-of-Code
-
-π- 2022 Day 7 Solutions -π-
git repo
-
-π- 2022 Day 5 Solutions -π-
Very ugly, very hardcoded, very dirty, and a really quick C# solution. Will clean up it in the next couple of days.
-
-π- 2021 Day 13 Solutions -π-
C# solution, this day is the day when my code for the first part returns the correct value for the second part! Secret is that I didn't read that I need numbers of dots after the first fold and I did print results out of curiosity. But it works!
-
-π- 2021 Day 10 Solutions -π-
Solution using Stack in C#
-
-π- 2021 Day 5 Solutions -π-
Some really ugly C# solution
-
-π- 2021 Day 4 Solutions -π-
not my proudest C# solution
-
-π- 2021 Day 1 Solutions -π-
C# repo. Happy AoC everyone!
-
2020 Day 20 Solutions
C# repo
-
2020 Day 19 Solutions
C# (C Sharp)
-
2020 Day 23 Solutions
Github repo, this is done, three more days to go...
What are some alternatives?
advent-of-code-2021 - π My Advent of Code solutions in Rust. http://adventofcode.com/2021
aoc - π My solutions and walkthroughs for Advent of Code and more related stuff.
AdventOfCode2021 - My solutions for the https://adventofcode.com/2021 challenge.
adventofcode-solutions - π My solutions to https://adventofcode.com/
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
advent-of-code - Advent of Code with JS
AOC2021 - Solutions for the Advent Of Code 2021
2021-advent-of-code - My attempts.
advent-of-rust - πadvent of code in rust π¦ (32%)
AdventOfCode
advent_of_code_2021 - My solutions to the challenges from Advent of Code 2021
adventofcode - Advent of Code solutions