there should be a test case where the largest consonant substring is the last N characters of the string. my solution passed but failed to account for this edge case.

the alphabet is abcdefghijklmnopqrstuvwxyz

you might have mistaken the order.

Maybe something wrong with my code, but i can pass all of the basic test cases and not one of a random tests on Python. How is that even possible, behaviour of random tests kinda inadequate.

I don't why but i think this kata should be at least 6 kuy, it took me longer than others 7 kuy's.

D translation

Really like this kata but i got stuck a little bit, because nobody noticed that i can jump over a list from another side, maybe it's an obvious thing but not for me ;(

That's the point of code golf. And it's the same for everyone.

Why are you counting spaces ? I understand that this is a symbol, but for making code in function I'm already losing 4 scores every row by default.

Lots of recurring questions are due to the fact the "how it worked" is crucial kata information, though it's shipped as back story. I also had to read that part again to get it right.

What do you think should be fixed? Most of them were proved wrong.

When this Kata will be fixed or I can't get something ? I have the same problem like a previous commentators