RussellChamp/advent-of-code-2025-cursor
1
0 Fork 0
mirror of https://github.com/RussellChamp/advent-of-code-2025-cursor.git synced 2026-10-28 08:02:33 +00:00
Code Issues Packages Projects Releases Wiki Activity
23 Commits 2 Branches 0 Tags
c9fdf547bb07cd2cb751f5ec3ca7895a0b5157ba
Commit Graph
5 Commits
Author SHA1 Message Date
Russell Champoux d8a67cf515 Add Day 12 solution (ft. an unused DLX library) 
Turns out two simple heuristics solve the whole problem in 4ms:
1. Does the area fit? No → invalid
2. Are there enough 3x3 spaces for all presents? Yes → valid

But hey, at least we learned how to use Dancing Links for
a problem that didn't need it. The dlx crate thanks us for
the download stats.
 2026-01-05 16:13:55 -05:00
Russell Champoux b067baac3d Optimize Days 1-8: 41% faster overall (39ms → 23ms) 2025-12-09 16:16:10 -05:00
Russell Champoux 6ff1349679 ⚡ Day 8: 2.2x FASTER with rayon parallel sorting! From 33ms to 15ms 💪 2025-12-09 16:04:45 -05:00
Russell Champoux d650dce61b Refactor days 1-2, optimize day 3 part 1 with suffix max 2025-12-04 17:34:11 -05:00
RussellChamp cfeb0828fd Initial commit 2025-12-04 16:22:10 -05:00