Thank you, that's awesome! I didnt even think about .reduce🙈

That's a very nice test-map.
I run a 10^6 simulations of a try-random-move-from-options-at-any-point solver and it finds the solution roughly once in 4000 attempts.

It helped me avoid trying a lot of bad heuristics, and to find a relatively elegant approach to the puzzle.

samee. v2 and v3 btw

I made the same mistake. The variable name has to be 'str' only.

Very nice kata! I realy liked this one!

mine takes 800 ms for all the tests

Learned about .repeat method. Thx

Hi, the solution will pass only if you find a way to solve the problem without loops. as wrotes below in the comments inList numbers are sequentially from 1 to n this should help you to solve the problem without loops

Python translation

So what kind of time should we achieve for the random tests? I get times in the 240 usec range but still fail

This doesn't answer my question. What response time are you expecting to not fail the time test.

Nice kata, congratulations.

You are right. I was able to pass them with your solution and some other I didn't try before from the solutions page. Your reasoning makes sense. Thanks for checking it out sayan warrior.

The tests are not broken. I just passed both Python and Javascript versions, the tests work fine.

It is possible that the kata has been updated which has caused some old solutions to be too slow on the latest language version, but the kata is still quite possible.

!!! TESTS ARE BROKEN !!!

Tried multiple solutions and couldn't get the execution time to be accepted,

INCLUDING the ones from the solutions page after skipping the kata

Tests still failed due to long execution time.