n = 46080, com = 'min'
[[16, 12, 8, 6, 5], 235] should equal [[16, 10, 9, 8, 4], 235]

Both options are fine. And which one to choose? The condition says nothing about this situation.

I first solved this kata very straightforwarly without numpy and no special trick, your original code was probably quite inefficient, I advocate for no reduction too.

As a result, numpy solved my problems

no reduction, this is 4 kyu

It's not really the number of test, but rather their size, the last five tests are very big.

I originally intended for people to use external libraries such as numpy to do the math part and didn't think people would bother to write the code themselves.

The final tests ended up, accidentally, being an extra challenge for those who wanted to give a go at making a more efficient algorithm.

If you just want to get it over with, use imports. Now, if you want a challenge, try to write it yourself.

config applied.

Maybe reduce the number of tests? I pass 129 tests and time out. I think my code is quite good

see description

<b not <=b

One of the tests for numbers in the interval (50; 257) gives an answer of 5 numbers, but this is an incorrect answer, there are 6 of them: 53, 73, 223, 227, 233, 257. Because of this, all tests fail