We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 422b88d commit e8821bcCopy full SHA for e8821bc
1 file changed
2025/Day08/README.md
@@ -1,6 +1,11 @@
1
## --- Day 8: Playground ---
2
+<em>
3
Equipped with a new understanding of teleporter maintenance, you confidently step onto the repaired teleporter pad.
4
5
You rematerialize on an unfamiliar teleporter pad and find yourself in a vast underground space which contains a giant playground!
6
-_Visit the website for the full story and [full puzzle](https://adventofcode.com/2025/day/8) description._
7
+Visit the website for the full story and [full puzzle](https://adventofcode.com/2025/day/8) description.
8
+</em>
9
+
10
+I decided to go with two implementations of Kruskal's algorithm, as part one and two are different enough. I didn't use a
11
+disjoint set representation. It's fast enough this way as well, and switching to disjoint sets would just make the code longer.
0 commit comments