advent-of-code-2021 VS advent-of-code-2021

Boring PHP solution, part 2 :

PHP solution, simple DFS for part 2 :

PHP, bruteforce. Part 2 below, it uses a formula to calculate the sum of a range. I'll now go check the optimal solutions.

PHP solution, also available on Github. It's not very optimal as far as memory consumption is concerned. The reason is that for a range of, for example, 1,1 => 4,4, it will allocate memory for four pairs. These might then get incremented if another line crosses either of the coordinates.

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.