O(n) time algorithm does not passing it. I don't know how can I do better. Probably, I should not check non-prime number.

Java has not description.

That was really hurt me. With Java...

I got same problem. I did use high value and It passed all tests. The description has to fix.

I did skip it until now. But I finally passed this kata. I am very satisfied because of I solved.

Congratulations. What is its name of formula? I didn't understand to the formula.

I suprised when I could not see time error. Thank you g964. 😁

Hi. Can someone explain me to fallowing topics.

There is a explain problems.

1-) An non decreasing number is one containing no two consecutive digits.

(left to right).

1235 is a non decreasing number by description.

for example: 1235

1 -> 2 (consecutive)

2 -> 3 (consecutive)

2-) ...whose the first is higer than the second.

for example: 1235

1 not bigger than 2

2 not bigger than 3

3 not bigger than 5

There is a contrast the description with examples.

Finally finished. Nice kata. Thank you KenKamau.

I am sorry.

from description: "Your friend has told you that he will be wearing a RED mask, and has TWO other friends with him, both wearing BLUE masks."

I did not understand when I looked to test cases. Can someone explain to me?

[Blue , Red , Blue] 
[Blue , Blue , Red]
[Red , Blue , Blue]

Which one is true? The kata is asking which is it?

The description can be better.

['blue','blue','red','red','blue','green','chipmunk'] -> 1

Why is the answer 1?
Red's location is 2.

'blue','blue','red'

Good kata. I enjoyed. Thank you kaluginpeter.

I completed to this kata series. I enjoyed while I solved to this kata series. Thank you g964.