Good call. Description was incorrect.

If the next small gift is beyond the specified distance from the current gift, but not further away from your home base than the nearest gift on the opposite side, proceed to collect it.

If the next small gift is beyond the specified distance from the current gift, but still closer to your home base than the nearest gift on the opposite side, proceed to collect it.

s = "..z...a..@......b."
return "zab"

a is at a distance of 3.
b and z are at a distance of 7.
So z is beyond the 2*3=6 max distance.
And z is not closer to the base than b.
But the test expects us to grab it as well since the expected result is zab

Am I missing something?

Damn! This is why I'm here.

wuaaouuuuuu

I almost considered doing your V1 case, seeing it actually here even though it's not used is still enough to make me laugh

Cheers mate

Thats crazy

I wanted to do it without using string :D

wha

I liked it as -best practice-, because the best practice it is!

my qualm with this is how does it function when p changes? from my understanding, lru cache should reset every time you call cut_log which means that you should have to recalculate every single time. but for some reason it works?

This solution only works untill n=15

And it looks like you saw the solution that I copied instead of the actual one I used

I copied that solution because I felt it is better to use if I would you use it in some other place