| Day | Part 1 | Rank | Part 2 | Rank |
|---|---|---|---|---|
| 24 | ||||
| 23 | ||||
| 22 | ||||
| 21 | ||||
| 20 | ||||
| 19 | ||||
| 18 | ||||
| 17 | ||||
| 16 | ||||
| 15 | 06:36:56 | 20584 | ||
| 14 | ||||
| 13 | ||||
| 12 | ||||
| 11 | ||||
| 10 | ||||
| 9 | 00:58:39 | 8,736 | 01:10:32 | 8,711 |
| 8 | ||||
| 7 | ||||
| 6 | 04:56:44 | 31,398 | 07:22:01 | 37,239 |
| 5 | ||||
| 4 | 11:42:46 | 63,634 | ||
| 3 | ||||
| 2 | 00:45:18 | 9,628 | 00:58:01 | 9,781 |
| 1 | 00:15:22 | 6,950 | >24h | 1,94,903 |
Total stars: 10*
Managed to bag a star in the suspiciously easy part 1. I seem to be missing something in the comprehension for part 2, since it works for the sample input, but not on the actual input
Well I'm not good enough to write a path-finding algorithm (yet)
A good solid for day 9. Glad part 2 was only a slight refactor since I was expecting something way worse. Not complaining though, I'll take the double star
Spent about 2 hours trying to get my code to run in the first place, doesn't work.
Figured out the first part of the problem, sorting the hands based on type of hand, but couldn't figure out how to sort within each hand.
Easiest one in a bit. Just took a while to comprehend the question. Got part one with pen and paper, and then later wrote the code for it. Runtime for part 2 was ~10s because of brute force, but if it works it works ¯\_(ツ)_/¯
Hardest one so far. Absolutely no ideas here.
Part I took a good while, and couldn't figure out how to write a recursive function to do part 2.
Had my eureka moment where I figured how to read cells adjacent to a certain cell, but couldn't figure out how to expand that to read the entire number after that.
Really happy to just have solved this at least. Didn't bother to read the question properly and spent 30 minutes trying to debug a solution that was inherently wrong in the first place. Just happy to take the stars in the end.
Didn't go too well considering the big hopes and dreams of the 'leaderboard', I'm missing an edge case on P2, and choked out of nervousness in P1. In retrospect, achieving a position on the leaderboard for P1 appears achievable with better execution.
Day 9 update: Finished Part 2 finally. An absolute bodge of a solution, but it taught me how to break twice inside a nested for loop