Ok, I feel really really stupid here but can someone guide me through the first step of creating something that allows "next" in a static method?
I need to return an "iter" on an array in the method?
Do I need to pre-populate the array with the millions of primes?

making me face my demons huh? ;)

I guess because , looking at the other solutions, i should have just switched it up and use the "top" row in the 2nd ("y") loop....?

don't ask me why i have 2 lines for the "edges"... :)

Weird grading for something this easy. I've had 5kyu that were harder (eg. the prime ant )
I agree my solution may not be "advanced Python talk" but still...

Here I thought I was gonna be a 'smart' cookie by doing quick jumps to queued positions, to make it faster.
(the distance can be up to tens or hundreds of "steps" from the lowest position)

My solution passes 1 out of 5 times, depending on the inputs.

Think i'll skip the "insane" version, looking at the other solutions i feel a python noob hahaha.

Great Kata though!

" ...it also means '00000' is definitely a short (in-character) pause, and '000000' is a long (between-characters) pause."
Yet in the "Hey Jude" example I see both 5 and 6 zero's being used "in-character"...?

in all seriousness, I agree. (the ranking and the "bad joke" :) )

3kyu are usually more difficult (for me).

I guess everything looks like a 5kyu if you're a "x dan" (compliment disguised as joke) ;-)

Great Kata!
@HKMT's one liner for compressing the grid makes me feel like a dunce... :)
(not just that but this one killed me , haha)

not the "python" way (that "compression" routine is embarracing , compared with HKMT's 1-liner) but it works...

prettyresult -> bad clean up, used for debugging...

(Python) Great Kata, but I got a feeling there's not enough random tests and hence I think my code isn't entirely full proof. (comments welcome!)