advent-of-code-2021 VS AdventOfCodeRust2021

Java (nothing special, simple implementation of the rules, I have only posted to fit for the rules here)

Java, the code is still a mess, but if you need some tips, it might help.

Java Using Dijsktra's alogorithm to find the cheapest path.

Java

Java if you are interested.

If you are using custom Coord objects, you could consider going in and making a map of coord to value. Saves a bunch of boundaries checks, as you can see in zebalu's solution (another comment in thread) https://github.com/zebalu/advent-of-code-2021/blob/master/src/main/java/io/github/zebalu/aoc2021/Day09.java

Java 17, could be shorter, but I find this more readable (Gauss has helped a lot.)

Java nothing special:

Java 17, if you are looking for one. (However, it is not really a Java community...) I was really lost in diagonals, and it is not an "elegant" or less then 100 bytes of code solution, but I hope it is readable, if you are lost...

Hi! Nothing special, I might refactor later (since it is very rushed together), but Java 17, if you are interested.

This one was just too much fun: solution in Rust

Part 1 nested ifs (does it count as "AI"?), Part 2 used DFS based on https://brilliant.org/wiki/depth-first-search-dfs/ solution in rust

My solution in Rust, took 158seconds to finish part 2 using multithreaded programming. 3ms for getting the solution to 80 days, pretty proud (day 6 of using Rust as well). I first tried to find exponential rate, but to no avail (I came pretty close)

Here is the link: https://github.com/JCardoen/AdventOfCodeRust2021/blob/master/src/day_four/four.rs