No, it doesn't, the reason is it returns either way, so only the first letter is checked.

Duplicate issue

Based on Giacomo's answer, I'm closing this issue. Regards, suic

@johnkershaw, I hope your students find their way and never get disappointed. please consider that the difficulty of kata is decided by whole community voting.

Look at my first solution, out of your list of requirements, I used string/int conversion only.

I didn't chop up a chunk of text into a dict (I used an eval, but this could easily be a for), I didnt use recursion (I used a plain old do while) and I didn't use Modulo.

I whole heartedly disagree.

this doesnt need anything of what you mentioned.

this kata need thinking about something more than coding, the answer is very simple ;-)

I see that you solve this now: we can close the issue, I presume.

4 more phrases adeded to all accepted languages please mark as solved

I fixed the Python version for future users (you will always see the same tests, regrettably), while I would suggest re-reading all the other examples.

You have all the example test cases to see, plus the description clearly states that you should do your magic once (and if) you find your first letter.

I cannot see any ambiguity in it, but feel free to suggest some edit :)