2025
This year will do it in Haskell, but might try few days in Rust as well
- Day 1 (0.018s)
- Day 2 (0.912s)
- Day 3 (0.038s)
- Day 4 (1.032s)
- Day 5 (0.014s)
- Day 6 (0.024s)
- Day 7 (0.021s)
- Day 8
- Day 9
- Day 10
- Day 11
- Day 12
Feedback
Day 1:
Day one was nice.
A bit rusty, on haskell but ok enough, after solving it I thought of a way to use scanl instead of recursion
Quite happy of the simplification I managed to do, next step would be to try and create those the first time and not using a temporary version
Day 2:
Today first solution was quite intuitive, then for the second one I tried different ideas to try and have a clean solution such as using Regex but didn’t manage to find a clean solution.
So I did it by hand:
Day 3:
Today was interesting.
I had to remember a few things about number and once I did I felt stupid not to have thought of it earlier.
Day 4:
Today was quite nice and after part 1 I just adapted a little bit part 1 to actually remove the rolls and that was most of the work for this part.
Day 5:
Today was the first day with an impossible solution, the first version of the second exercise crashed so I had to think a bit and make a cleaner version before solving the problem.
Day 6:
Today, the puzzles were very simple, the actual thinking was the parsing.
At first I just decided to split on the spaces which worked for part1 but then I ended up removing important information for part2, so I had to adapt the parsing.
Day 7:
Today needed the some sort of memoization, instead, I decided to limit the number of calls to the strict minimum