aoc
adventofcode
aoc | adventofcode | |
---|---|---|
4 | 59 | |
2 | 6 | |
- | - | |
8.2 | 8.5 | |
4 months ago | 4 months ago | |
Go | Julia | |
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.
adventofcode
-
-βοΈ- 2023 Day 10 Solutions -βοΈ-
Code on GitHub is currently a mess.
-
[2023 Day 5] Exlplanation Like I'm 5
In the spirit of the Day 5 ALLEZ CUISINE! challenge to ELI5 (Explain Like I'm Five), here's a tasty explanation of how my algorithm works using only a large bucket of Red Vines and a knife. It says to use lined paper, but if you try this at home consider aligning things on a cutting board.
-
-βοΈ- 2023 Day 4 Solutions -βοΈ-
[Language: Jsonnet] (on GitHub)
- -π- 2022 Day 25 Solutions -π-
-
-π- 2022 Day 24 Solutions -π-
Elixir code, thoughts
-
-π- 2022 Day 23 Solutions -π-
Elixir 1554/1502 code, reflections
-
-π- 2022 Day 21 Solutions -π-
Elixir 2506/3402 (24 minutes, 2 hours), code, thoughts
-
-π- 2022 Day 20 Solutions -π-
Bonus solution in Go (golang) because I was confused about why my Elixir solution didn't work and decided to implement from scratch in case I'd done something dumb. The Go one also got the wrong answer, but took less than 100ms instead of a minute, so I could try out lots of tweaks that didn't change the answer.
-
-π- 2022 Day 19 Solutions -π-
Elixir 2031/2641 after 3.25/6.5 hours! Code on GitHub
-
-π- 2022 Day 18 Solutions -π-
I spent time this afternoon sprucing up my helpers for the iex REPL. I spent a bunch of time poking at things in IEx the last couple days and wanted to make sure I would minimize keystrokes if I needed to debug things on my phone while drunk. Turns out Thursday night > Friday night > Saturday night in terms of difficulty, so all those macros have so far saved me zero seconds :-)
What are some alternatives?
advent-of-code-2021 - π My Advent of Code solutions in Rust. http://adventofcode.com/2021
adventofcode - Solutions for problems from AdventOfCode.com
AdventOfCode2021 - My solutions for the https://adventofcode.com/2021 challenge.
adventofcode - Advent of Code solutions of 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022 and 2023 in Scala
aoc2021 - Advent of Code 2021 - my answers
AOC2021 - Solutions for the Advent Of Code 2021
AdventOfCode2021.jl - Advent of Code 2021 in Julia
advent-of-rust - πadvent of code in rust π¦ (32%)
aoc2021 - Advent of Code 2021 on my homemade 16-bit CPU SCAMP
advent_of_code_2021 - My solutions to the challenges from Advent of Code 2021
rockstar - The Rockstar programming language specification