That's it.

Resolved. Added sample explanation. Also fixed a typo.

Thanks for your contribution!

Sorry, I hardly go to Codewars.

Your solution is incorrect. The numbers are very large and your solution may recurs v*n times. So your program will get a stack overflow.

The time complexity of the solution is O(n log n). Think more!

Fixed. Thanks.

XDDDDDDD

Should be fixed now.

I can attemp the initial empty solution and get no errors and warnings now.

Is it be fixed now?

Should be fixed now.
If not, put a semicolon on the end of sample test.

HHHHHHH best answer