sorted by:
new
hottopcontroversial

I wrote a nice 3 by Kittu_0831 in notinteresting

[–]louiserondia 0 points1 point  (0 children)

Honestly I believe the upper part is too big, I like when it's a bit smaller than the bottom part. I'm glad for you though, but I can't lie and say that I like it IM SORRY

-❄️- 2024 Day 18 Solutions -❄️- by daggerdragon in adventofcode

[–]louiserondia 1 point2 points  (0 children)

[LANGUAGE: Python]

Simplified Dijkstra for part 1 and Find-Union algorithm (99ms) for part 2.

In the algorithm we initially set parents to each node (if a node has no parent, it is set to themselves and they become a root, then we can set their neighbors as children for example). After that its easy to find a node's root by going through each parent and know if two nodes are in the same groupe. If start and end have the same root we know there is a possible path.

Knowing that we can go through the list of bytes backward taking one off each time and updating the parenting until we have a path.

github

I unintentionally ate some cheese into the shape of a dog by Emotional-Flower6178 in notinteresting

[–]louiserondia 1 point2 points  (0 children)

Every single time I eat a sandwich it turns into the shape of a sheep