Just compute the colors at each step ;)

nice kata! not too hard but makes you think.

your code length = 101 - Expected: 'code length < 53'
I thought the tests would be maximum length 53 damnnnn youuuuu

my bad. In our country it also goas O->G so I naturally thought its the same. Should read describtion more carefully.

Try read Kata "Traffic Light Rules" description again. There is no such transition as O->G

Failed that one :( Troulbe for me was the orange light, if I could always replace with the same color would be no problem but since its O->R / O->G couldn figure what was the preceding color

look at the very first test (the description is absolutely bad, actually)

language is Javascript. Not sure if tests are correct.
10-th Fibo: expected 55 to equal 34

not an issue. You'll hit the time limit way before you get to that value anyway, and unless the translator didn't do a good job, the recursive solution is supposed to pass, meaning you'll never get outputs that big anyway.

(woops)

done. But don't forget to tell about the language, when you raise an issue.

Tests are so weak. You dont know what youre testing, what your supposed to get , ... nothing.

https://github.com/codewars/codewars.com/wiki/Troubleshooting-your-solution

Just tested javascript (mention the language when reporting an issue) and works fine, the error points to a problem in your code, that we can't see.

Works fine on my computer. But in browser always throws this error:
"TypeError: solution is not a function".