I wish I had thought of this.

Nice one.

I did not know you could do this

Lol when I wrote my code, I was like somebody going to find a cool way to do this even though it's not hard. Great solution!

.

Use spoiler flag next time.

The samples in the description don't match the accepted solutions. The description shows 0 and . characters, but the expected output is 1s and 0s.
There are other issues too, but other people have already mentioned them.

Some minor issues:

Description

• name of a man - "Penny" is not a man
• Why is initial Queue order specified? Doing this made the names parameter unnecessary.

Initial Solution (Java)

• Java syntax - should be String not string

Initial Tests (Java)

• Don't need new Line() to call a static method

Amazing so many different algorithms people used to solve this one. Nice Kata :-)

You shouldn't make the index 1-based. No sensible programmer ever does that.

http://www.cs.utexas.edu/users/EWD/transcriptions/EWD08xx/EWD831.html

You also shouldn't encourage people to hard-code the names. Using examples in the question is fine, but when you pass in the array, you should expect them to use that array. Telling them it is count 5 defeats the purpose of passing in the array.

There's nothing wrong with the problem, I assure you guys. I just solved it now.
I have a feeling you're using too much ram or taking too long to complete. The test cases use really gigantic values for n.
Or your internet is having problems. I notice hiccups in submitting solutions in those cases too.