yes. every recursion could be rewrited in loops if language allows loops

is there a way for a possible solution without recursion?

Values from 0 to 200 will be checked

The random tests only go up to 20.

someone did

Python version: tests for 0 to 11 should be added to sample tests like the other language versions.

Hmmm, for some reason I thought, that random.choices already selects unique elements. In this case, random.sample is better, indeed.

Use of set suggests the unique elements are desired, what would make random.sample possibly a better fit.

For some hints, see here.

I would suggest using random.choice in main tests.

y = random.choices(range(1, 21), k=random.randint(5, 9))

instead of

y = list(set([random.randint(1, 15) for i in range(20)]))

Ive tried to fix it, chech this out, please

Thank you too!

All correct, now.

Thanks!

Check again, please

1. Can you pass the tests using this solution?

   I am not sure whether authors can see option of "TRAIN" or "TRAIN AGAIN",
   if you can see that,
   try running this solution
   otherwise
   open train link of the kata in private window, and run this solution.

   You'll see this solution do not pass tests.

I think that the whole list is simply not displayed by the site

This is entirely wrong statement!(If that would be the case, then I would get Exit Code 137, Max buffer limit reached)

(Do you think the test framework just give up and call it a day?)