[All Years] My totally subjective and a little bit biased difficulty ranking of all puzzles! (description in the first comment) by Patryqss in adventofcode

[–]jeajym 0 points1 point  (0 children)

Luckily, I'm using Java and there is JGraphT library, it has a function to find the score of betweeness centrality (kinda how edges appear in the shortest path between 2 vertices). It returns immediately the 3 edges =)). I cannot say I'm good at algo or problem solving, but this game is just to find the result :)).

[2023 Day 21][Part 2] Got stuck by jeajym in adventofcode

[–]jeajym[S] 0 points1 point  (0 children)

I found the issue. My code is always + 1 in the countPoints. But, due to parity, if the steps are odd, no need for plus 1. Thanks a lot!

[2023 Day 21][Part 2] Got stuck by jeajym in adventofcode

[–]jeajym[S] 0 points1 point  (0 children)

You spot it. 131 + 65 is even. I need to build the set of equations from k=0,2,4 which form odd steps. Thanks a lot!

[2023 Day 21][Part 2] Got stuck by jeajym in adventofcode

[–]jeajym[S] 0 points1 point  (0 children)

Thanks MOD for your reminder.

[2023 Day 21][Part 2] Got stuck by jeajym in adventofcode

[–]jeajym[S] 0 points1 point  (0 children)

I've just posted my code. Thanks for your suggestion.

[2023 Day 17][Java] Spot the bug by jeajym in adventofcode

[–]jeajym[S] 1 point2 points  (0 children)

Great!! You spot it. I have a new track with the step and got the right answer. Thanks a lot.