aoc VS AdventOfCode2021

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

Go

Go solution abusing of slices

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.

I found this repository which solves the problem by having a src/main.rs file which basically calls cargo run --release {day} and parses the output to extract the time each day took, but I don't find this very satisfactory. I'd prefer to have everything compiled into the same executable, without having to run external commands.

You can always check out the problems from previous years.

https://adventofcode.com/2021 for practice.

Here is 2021: https://adventofcode.com/2021