My solution is not actually checking it is the shortest...
I tried a first approach to find the more direct path (the one that minize the distance at each steps). And this was already passing 200 test.
Then I added a recognition of 2 moves bypass... i was only failing ~10 test... Then I tried to test the revers solution (inversing start and end) which is also a solution...
And that was it...
So actually it passes all test but I cannot proove I am alsways looking at the shortest solution, it just happen I am covering all test... Or maybe I am covering all possible test... But who knows...

Actually my code is doing more... I missed that the input list is ordered. My code can take any random list...

Hi, how many tests there are? I am able to pass 44 of them before it times out... :(

• DONE

Actually, I really enjoyed this one... I stumbled a long time on how to make it faster... Also finding a coordinate to spiral_number algorythm took me some times... I have to say I wonder why it is only a 5 kyu but I am new that might explain...

Thank you