OH! Thank you, but do you know why it wasnt returning values that should have been there? Or even allowing me to input an index higher than the length of the list of numbers?

I am doing the python translation. I wrote an efficient enough implementation of an Eratosthenes Sieve that runs in the allocated time and finishes before the time out at 12000ms (usually around 8500ms). An unusual error that I believe is on codewars' side has arisen and it doesn't make much sense to me. When testing for primes over a certian number (I think it is in the 14M - 15M range), it returns nothing (like literally nothing - just []). If I try debugging using list slicing to isolate that portion of the list, it allows me to so with no errors, yet returns an empty list: []. There are no try/except statements in my code hindering this error detection, before anyone asks. When I run my program in PyCharm it returns a list perfectly filled with primes up to 16M in no more than 3000ms, with no full-empty lists like on here. Does anyone know whats going on?

I adressed that in the description. All of the fixed tests have one solution. Any random quadratic has a low probability of having 1 solution, since the vertex has to be touching the x-axis.

Why was this kata retired? I searched for a little while and couldn't find any like it.

First 3kyu in the books!

Oops, i forgot to import that to the test cases...

noted. i'll fix it when i get back to my computer.

Im going to take your advice because you are a lot more experienced than me, but is this neccesarry? I feel like it is kind of redundant to have only one nested it block within the describe blocks.

I changed the paramater to "s" even though it worked, I see how it could cause problems and isnt the best practice.

Sorry, I was testing something in the random tests and forgot to add the ''.join(str) back in. It should be fixed now.

I dont understand how this solution works. The random tests should make it invalid. Unless the random tests dont work.

So its safe to say that you are just trying to reach the bottom right corner.

All libraries have driver code, you can look up the docs to find it