21
🤶 - 2025 DAY 8 SOLUTIONS - 🤶
(programming.dev)
An unofficial home for the advent of code community on programming.dev! Other challenges are also welcome!
Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.
Everybody Codes is another collection of programming puzzles with seasonal events.
Solution Threads
| M | T | W | T | F | S | S |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 8 | 9 | 10 | 11 | 12 |
Icon base by Lorc under CC BY 3.0 with modifications to add a gradient
console.log('Hello World')
Kotlin
First tricky puzzle today, instantly leading me to more or less brute force for part2. I took a lot of time to understand which data structures I needed today, and how to compute my matrix.
Runtimes:
part1: 141ms
part2: 45.9 seconds .-.
Solution
full code on Codeberg
That is a very unoptimal pt2 time! Have you tried profiling to see what's causing the slowdown? Mine is 300ms, or worst case, 4s to process all links.
My algorithm is probably pretty horrible, I was purely out to get a solution as fast as possible. I might try improving it after Day12...
That's interesting. I found part 1 to be the hard part and part 2 was just simplifying part 1. They ran in about the same time for me, too.
Part 1 run time:
Part 2 run time:
Code:
Oh wow, I see you went the Kotlin way of hacking together an object with Pairs and Triples. I used to do that too but then it got too confusing lol
It can be confusing, for sure. But I really like Pairs and Triples.
answer = distance.first.first.first * distance.first.second.firstis not very elegant, lol.