he/him | Software Dev | 日本語勉強中
I needed a hint to realize I was overthinking this. That said, I do like the solver I wrote, it's just too slow. I think this is an NP problem for certain input.
#AdventOfCode adventofcode.com/2025/day/12
I needed a hint to realize I was overthinking this. That said, I do like the solver I wrote, it's just too slow. I think this is an NP problem for certain input.
#AdventOfCode adventofcode.com/2025/day/12
Back on my grind💪. This was a fun complete graph search which took a nice insight to optimize counting for Part 2.
#AdventOfCode adventofcode.com/2025/day/11
Back on my grind💪. This was a fun complete graph search which took a nice insight to optimize counting for Part 2.
#AdventOfCode adventofcode.com/2025/day/11
My first "loss" of the year. My shortest path algorithm for part 2 is too slow😞.
I won't import a SAT/Constraint library to do it for me and I lack the math to write the linear algebra from scratch.
#AdventOfCode adventofcode.com/2025/day/10
My first "loss" of the year. My shortest path algorithm for part 2 is too slow😞.
I won't import a SAT/Constraint library to do it for me and I lack the math to write the linear algebra from scratch.
#AdventOfCode adventofcode.com/2025/day/10
That was messed up💀. Computational geometry is not my forte, and I had missed a variation on an edge case which I only realized after seeing somebody else visualizing the input data.
#AdventOfCode adventofcode.com/2025/day/9
That was messed up💀. Computational geometry is not my forte, and I had missed a variation on an edge case which I only realized after seeing somebody else visualizing the input data.
#AdventOfCode adventofcode.com/2025/day/9
Kinda tough graph problem today! Only 4 mins between Part 1&2😂. First solution was navigating the graph on each new edge: Long to type and slow! After optimizing it was simpler and Part 2 went from 3.5s to 1s.
#AdventOfCode adventofcode.com/2025/day/8
Kinda tough graph problem today! Only 4 mins between Part 1&2😂. First solution was navigating the graph on each new edge: Long to type and slow! After optimizing it was simpler and Part 2 went from 3.5s to 1s.
#AdventOfCode adventofcode.com/2025/day/8
I am wayyyyy too optimistic about simulating everything. It worked for Part 1 but of course Part 2 became exponential. Took me a little bit to realize the simplification.
#AdventOfCode adventofcode.com/2025/day/7
I am wayyyyy too optimistic about simulating everything. It worked for Part 1 but of course Part 2 became exponential. Took me a little bit to realize the simplification.
#AdventOfCode adventofcode.com/2025/day/7
White space sensitive string manipulation💀
#AdventOfCode adventofcode.com/2025/day/6
White space sensitive string manipulation💀
#AdventOfCode adventofcode.com/2025/day/6
I fixed an overcounting bug in Part 1 but mistakenly ctrl-z'd my fix and lost time debugging. For Part 2 I think there's a data structure for it but I ended up implementing a custom array/set thing.
#AdventOfCode adventofcode.com/2025/day/5
I fixed an overcounting bug in Part 1 but mistakenly ctrl-z'd my fix and lost time debugging. For Part 2 I think there's a data structure for it but I ended up implementing a custom array/set thing.
#AdventOfCode adventofcode.com/2025/day/5
Starting to get harder. It was fast enough to just simulate it (with a smart representation) but I suspect there's some clever graph based solution. Not convinced that'd be better though.
#AdventOfCode adventofcode.com/2025/day/4
Starting to get harder. It was fast enough to just simulate it (with a smart representation) but I suspect there's some clever graph based solution. Not convinced that'd be better though.
#AdventOfCode adventofcode.com/2025/day/4
Another good time. My initial solution for Part 2 was recursive and took about 3.5 seconds to complete. After optimizing it to be bottom up I got down to 150ms (faster than my brute force Part 1 lmao).
#AdventOfCode adventofcode.com/2025/day/3
Another good time. My initial solution for Part 2 was recursive and took about 3.5 seconds to complete. After optimizing it to be bottom up I got down to 150ms (faster than my brute force Part 1 lmao).
#AdventOfCode adventofcode.com/2025/day/3
Very happy with my times today! I spent some time afterwards optimizing my Part 2 solution and by avoiding extra memory allocations my runtime reduced by 33%.
#AdventOfCode adventofcode.com/2025/day/2
Very happy with my times today! I spent some time afterwards optimizing my Part 2 solution and by avoiding extra memory allocations my runtime reduced by 33%.
#AdventOfCode adventofcode.com/2025/day/2
I'm happy with my Part 1 time but I lost a bunch of time to silly bugs with modular arithmetic in Part 2.
Since we only have 12 days this year I think they made Day 1 a little harder.
adventofcode.com/2025/day/1
I'm happy with my Part 1 time but I lost a bunch of time to silly bugs with modular arithmetic in Part 2.
Since we only have 12 days this year I think they made Day 1 a little harder.
adventofcode.com/2025/day/1