Got up to 140 passes in the available time. Still not enough!

Have enjoyed working on this! Thanks. Unfortunately my solution - a backtracking algorithm - is too slow. It gets through approx. 120 tests. Could you indicate how many tests are there in total?

Aha, I have just seen what I was doing wrong. Whoops.

Argh, I am having this issue and cannot - despite much trying - see why C doesn't win... A hint would be much appreciated - or is there a problem with the test/problem?

Enjoyed this one, thanks.
Just a minor issue with the description...
It says the maximum number of invalid entries permissible is 10% (where there are 11 or more entries) but I think it's meant to say the maximum permissible is anything under 10%?
10% invalid entries is too many, as discovered in the second-to-last test case, where 2 invalid entries out of 20 makes the array invalid.

This had me stumped for ages until I started thinking about the pattern of how the numbers have to move around the result in the next bigger value - and even then I had a few false-starts.
Challening but rewarding, and not like any kata I've already done.
Thanks!

Hi,

My solution is failing the 'works with other kinds of class' test, because I'm using .flatten within the method. I'm not really sure what this means given that the problem only applies to a comparison of one array (the argument) against another (self). Can't get my head around the nesting structure of something that isn't an array! Am I missing something?

Many thanks!

My 'solution' is working in my environment but not on codewars. The problem seems to be conditions such as:
x % (1024) == 0
Even when x is for example 9*(1024) this is evaluating as false, so I'm unable to format the answer properly. (I can't in this instance put 9Ym rather than 9.0Ym.)
Any idea why % isn't working for me?
Thanks!