• Custom User Avatar

    Seems ok indeed. Maybe I did something wrong. Thanks for answering!

  • Custom User Avatar

    Have you tried since? I haven't noticed any issue.

    Maybe you should try to press the Reset button?

  • Custom User Avatar

    Unless I do miss something there's a problem with tests since initial code times out.

  • Custom User Avatar

    It was difficult to understand the task just by looking at the text, but happy could solve it finally.

  • Custom User Avatar

    Thanks, now its clear!

  • Default User Avatar

    After 32 meetings of green and blue chameleons, numbers will be [98, 0, 3] (chameleons don't disappear, so the sum must remain the same). After that, meeting red+blue gives [97,2,2] and then you need TWO more meetings of green+blue to get [101, 0, 0]. 32+1+2 = 35.

  • Custom User Avatar

    Can you please helt me to undaetnad the problem, 34, 32, 35 -> 35 -32 = 3, so will be come 50, 0, 3 and 49, 2, 2 and 51, 0, 0 so counting this will become 34 not 35, please help me to undertand the task is not very clear, Thank you!

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    Amazing kata!

  • Default User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Custom User Avatar

    This comment is hidden because it contains spoiler information about the solution

  • Default User Avatar

    This kata should block System.Reflection, but no. Fix please.

  • Custom User Avatar

    Hey! Here's a Java translation. Have a look ;)

  • Custom User Avatar

    Good Kata! I had the mathematical details worked out but I don't know much C# grammar yet I want to make it work. I know my code may not look good/professional but I enjoy it~

  • Default User Avatar

    Can you add this test chameleon([0,1,6], 1)? It complements the test added by AlexIsHappy with a case where one other color is "vastly" superior to desired one (explanation here).

    Another suggestion for the description - wording is slightly misleading:

    they can change their colors to a third one (i.e. when red and blue chameleons meet, they can both become green)

    They both change their colors each time they meet.
    With this wording, you can think it is possible for them to keep their colors - which allows this incorrect case chameleons([0, 1, 2], 0).

  • Loading more items...