This should also pass with "D:", which is the opposite of a smiley! :)

I assume my program is working correctly in C#. But I got a timeout. What would you recommend me to do? Thanks!

This code is wrong, and test should be adapted. Because of "1,3,2,4" --> is not ascending!

@g964 Hi, could you please have look at the question two days ago. It is not resolved. :(

This issue is not resolved. The test is given by CodeWars, not by me. @g964

Downvotes without answers are useless. ;)

@g964 But some of the test are working. I put seven tests in one? But I use the test cases of Code Wars.

Downvotes without answers are useless. ;)

I am not sure if correct, but the route is depending of the places you visited before.
If you first travel A --> B --> C than you can't just copy the distances if you travel from A --> C.
Do you understand the problem?
So the Kata makes logically no sense to me.

Hi, I am using C#.
For number 21 the prime number 7 is not listed in the results here. Did I do something wrong?
The input numbers are following.

12,
15,
15,
21,
24,
30,
45,
107,
158,
204,
100,
118,
123,
126,
110,
116,
100,
-29804,
-4209,
-28265,
-72769,
-31744

Desired output is: //"(2 -61548)(3 -4209)(5 -28265)(23 -4209)(31 -31744)(53 -72769)..." ---> no (7 ...) occurs!

Many people say the code is clever, but it is just wrong. Be careful my friends.

This approach will fail soon. :/

This is not 8 kyu. Maybe 7 kyu.

@FArekkusu Could you emplain why? :/

Best LOL of the year for me. :D