how would you solve this recursively w/o R?

love your solution. plain and simple for a complicated problem.

really love this kata, thank you g964. i'm however a bit puzzled at the moment over how the sets should be grouped.... i'm tored. about it. on one hand. the 4, 4, 4, 4, 0 make sense. the 6, 6, 6, 6, 4 doesn't since 7, 7, 7, 7, 0 would be a better fit (at least to me). what about 1, 1, 1, 2, 1.... can the 4th number be bigger as long as the 5th number is smaller?

i know you have probably answer this a million times already... i'm just not clear about the instructions. if you can pls explain the significance of the math behind the 11/5 => 2.2 much appreciated. cheers!!!!

thanks for explaining casting,
the brackets with the 3 dots in it [...]

i got it now!

love that you figure out a way to build each level with the correct elements on it

i really like this chunk

if (st === '' || n > we.length) {
    return st === '' ? "No participants" : "Not enough participants";
  }

and the rest i'm still admiring. thanks for your beautiful code!!!

nice to see a solution from the author. thanks

took me a few days to slove this kata, thank you so much for explainations, really helped me understand how to write better code in the future.

the rules in this kata is really difficult to understand and the test data is misleading because the patterns do not repeat as expected. for instance, john's pattern [0, 0, 1, 0+2, 0+2, 1+2...] and ann's pattern [0, 0, 0+2, 0+2...] do not match your sample tests. can you state the rules in such a way that your sample tests reflect what the rules dictate?

also, why set n = v? why not just use n itself

var a = fillArray(1, n), y = -1, v = n;

was wondering why you did this:

while (a.length * 2 <= len) a = a.concat(a);