Actually I think this passes and my issue is elsewhere. Sorry!

I believe this should be correct:

if not sum(m.count('k') for m in maze) == 1: raise Exception("There should be no multiple Kates")

but this does not pass. I am not an expert on errors/exceptions...

Mazes are not THAT big. May be your Kate is walking in circles?

it is a mere Exception with the following message : "There should be no multiple Kates"
exactly as in example tests

Great Kata! Working really hard to solve this. Managed to go through Sample cases but my code times out when I run. What kind of sizes of mazes we are talking about ?

try using integer division (// not /)

Can you fix the code and give to me something to copy and paste?

There is a bug in the C# solution. The given solution expects 0 for the case start == end, but the actual result should be start (or end). Please fix your solution!

Solving in Python, anyone with a suggestion on how to solve difference between scientific numbers and int?

Thanks in advance

I don't see your solution yet. Once I have it, I'll upvote it. :)

After some weeks of thinking I got the "catch" of the kata.

Will just include some derangement calculation on my solution.

Great kata dude :)

You should return with your function how long it will take for all the customers to check out. The first argument will bring you a list of how long each client will take. The second argument will tell the amount of queues available.

Hi acker241. It's an initial challenge to force us to create a good algorithm. Otherwise we won't pass the random tests. We have 100 of them