There are no random tests. The kata only tried by making a random number of same calls at the middle.

This kata is still stuck in Node 8.

Fixed

One of the sample tests fails even when all the final tests pass.

Or is it that, if it is possible to construct a logical expression using less than argArrLength arguments, which evaluates to the same boolean value, then we should return the indexes of any n arguments (n < argArrLength) that can be used to construct such an expression? And if it is not possible to construct such an expression, just return the indexes of every argument?

My understanding of the description is: we should return the indexes of the fewest arguments necessary to construct a logical expression that evaluates to the same boolean value as whatever logical expression func returns.

Is this correct? (sorry, it's hard to talk about this kata without the wording getting convoluted :P)

C#-Translation kumited!

https://www.codewars.com/kumite/57cac00b58a06b6b80000014

It was not easy to translate, but I added random chosen calls.

Please check and approve it!

Great idea for a kata!

But in the example tests, the last Assert should be a "Test.assertSimilar".

Thanks, this is really helpful. Will update soon.

If you want solve katas like this,
I can create more and more... ;-)

T.T.T.18 solved too, so where's number 19,20 and 21...;-)?

T.T.T.18 is published, Mr.right & Mr.wrong #2 is coding

PS: T.T.T.17 is solved;-)... Only one "morning coffee kata" today;-)...

还不够完善:-(?! I'm working on it;-)... Good morning katas... just a little bit difficult at the moment, not so much time, but surely later on;-) Having holidays, so generally a codewars free time with some little exceptions:-)...

Your "morning coffee katas" are ready(two or three) ;-)