Post the error you are getting. I can't help if I don't know it.

I got the same issue :/

Passed: 38 Failed: 1 Errors: 1

I am noticing this same problem with python kata. I am passing the 4 examples and all basic tests:

Test.assert_equals(solve(0,20),14)
Test.assert_equals(solve(2,200),457)
Test.assert_equals(solve(2,2000),17705)
Test.assert_equals(solve(2000,5000),25005)

And, passing about 4 - 8 random tests. However other random tests between ranges of about 500 - 1000, I am failing. There are no timeout issues, my algorithm simply returns the wrong number of primes. Strange how I'm passing some tests yet failing others despite their ranges being within the same numbers?

UPDATE: I ended up passing this one, without changing my code, similar to the above user, Cptnprice.

Thanks. I have updated the description. The test cases were correct.

Thank you Cptnprice. If it comes back to you, please holler.

No-no) Maybe I did not explain clearly enough: in that basic test, when 1-st work-chain ends at "9", "10" is just exactly the pass-step we need. So at the next sircle we start from [0]-index element again; if the last item in a basic chain was "9", to pass 1 step for keeping the order we would have to pass "2" and start the next chain from "4". And keep doing this till the arr has length =2, after what we would add these 2 last items in reverse mode.
Hope I did not confuse You)

In your solution of this test there is only one last item at the and so the way of adding it is only 1 too. But as I think, according 2 description there should always be one pass-step so when U start working with the rest of the arr again and again, U shold watch 4 this order: after first circle next 1 is ['2','[]',the] after which we have ['big','out','!'] and take from it ['out'] and ['!','big'] reversed at the end.
And what I definitely understand, this kata needs more detailed description.

U R missing next thing: when there are 2 last values of the arr, they should be added in reverse mode ( arr[1] than arr[0] ), according 2 description.

Thanks!

@Dentzil, under what circumstances should the case be changed?

UPDATE:
Ok, realized the alphabet used has 52 letters: first 26 are all lowercase [a-z]; rest are uppercase [A-Z].

Thanks for the interjection, Kazk!

(reposting from below)

@Cptnprice, ' Sr2\tynF' == ' ' + 'S' + 'r' + '2' + '\t' + 'y' + 'n' + 'F'