https://github.com/birchmd
https://www.typedriven.ca/portfolios/
⭐⭐⭐⭐
#booksky
⭐⭐⭐⭐
#booksky
1/2
1/2
www.mscroggs.co.uk
www.mscroggs.co.uk
I always have fun with these puzzle! Thanks to @was.tl for putting them together!
I always have fun with these puzzle! Thanks to @was.tl for putting them together!
I used a recursive function with memoization, which isn't particularly Rusty, but it does work. Maybe I should try to refactor it as a loop with explicit stack instead of a recursive call 🤔
I used a recursive function with memoization, which isn't particularly Rusty, but it does work. Maybe I should try to refactor it as a loop with explicit stack instead of a recursive call 🤔
For part 2 today I had to break my streak of only using the Rust standard library and pull in a linear programming solver.
For part 2 today I had to break my streak of only using the Rust standard library and pull in a linear programming solver.
I thought part 2 was pretty hard today! I'm sure there is a clever algorithm that I don't know about to make a very fast solution, but my kind of brute force one still finishes in about 1s.
I thought part 2 was pretty hard today! I'm sure there is a clever algorithm that I don't know about to make a very fast solution, but my kind of brute force one still finishes in about 1s.
I do appreciate having a good excuse to use a min-heap 😄
I do appreciate having a good excuse to use a min-heap 😄
Dynamic programming remains one of my weak spots, so part 2 took me longer than it should have. But I got there eventually!
Dynamic programming remains one of my weak spots, so part 2 took me longer than it should have. But I got there eventually!
This was a fun one (obviously; they're all fun)! Was it secretly a 2D grid problem? There are probably other ways to solve it, but this approach was my first thought and it worked out.
This was a fun one (obviously; they're all fun)! Was it secretly a 2D grid problem? There are probably other ways to solve it, but this approach was my first thought and it worked out.
I was worried when I saw overlapping ranges that I was going to need to use a special algorithm that I definitely do not remember. But fortunately a simple approach worked!
I was worried when I saw overlapping ranges that I was going to need to use a special algorithm that I definitely do not remember. But fortunately a simple approach worked!
It wouldn't be Advent of Code without a 2D grid puzzle ❤️
It wouldn't be Advent of Code without a 2D grid puzzle ❤️
I enjoy the puzzles where part 2 is a clean generalization of part 1. It makes me wonder if I was thinking ahead maybe I could have given the first solution an extra arg to make solving part 2 trivial.
I enjoy the puzzles where part 2 is a clean generalization of part 1. It makes me wonder if I was thinking ahead maybe I could have given the first solution an extra arg to make solving part 2 trivial.
It's always satisfying to do problems involving identifying numbers by digit-based rules using only arithmetic (never treating the number as a base-10 string).
It's always satisfying to do problems involving identifying numbers by digit-based rules using only arithmetic (never treating the number as a base-10 string).
I just completed "Secret Entrance" - Day 1 - Advent of Code 2025 #AdventOfCode adventofcode.com/2025/day/1
I just completed "Secret Entrance" - Day 1 - Advent of Code 2025 #AdventOfCode adventofcode.com/2025/day/1
I also had fun playing the deck myself of Arena.
Thanks for sharing it @mtgcreativecombos.bsky.social !
Lots of high mana value cards makes Duskmourn's Claim (Parker Luck) do potentially 6-8 damage per turn. Geological Appraiser discovers into it, and the lands manipulate the top of the deck.
Decklist and Gameplay: youtu.be/8vFbUhJTFvM
@fireshoes.bsky.social
I also had fun playing the deck myself of Arena.
Thanks for sharing it @mtgcreativecombos.bsky.social !