OP solved it, closing

Great find hahaha

Use spoiler tags please.

That is fucking awesome! But this solution have a bug in this case: count_smileys([":))",";-D"])
expected result: 1, but instead we got: 2.

Yeah the author is probably laughing maniacally right now.
While 1111111112 does give you 12345678987654321 the next one
11111111112 gives 1234567900987654321 and not 1234567890987654321.

The author never said that the lines in the pattern always follow this amazing fact. He just put it there to confuse us I guess. What he wants is just the pattern independently of this fact.

That's right, the output for that input should be 'A3(ywhCMR/GfKl.YLC5z8aOYO7T,.F2p@6AgqJP/rIHe/;@B*vyry7.lP<D:Kt5Z+W@.m1XuUDo4w9Thxb4/aw*:Y?C,Nf(aXb;:kXv'. Is that not what the random test is showing?

"If the strings are different lengths the function should interlace them until each string runs out, continuing to add characters from the remaining strings."
^The instructions say the above. Consequently, for this test case:

["AY2e7tm4xw", "3Lp/.51wbC(", "(C@;", "y56@l", "wzA", "h8gBPZX94:,a;", "Caq", "MOJ", "RYP", "/O/v<+uT/YNX:Xv", "G7", "fTryDWUha?fbk", "K,Ir:@D", "l.", ".FHyK.o"]
the output shouldn't be "A3(ywhCMR/GfKl." right? It should continue until each string is empty...at least that's my understanding

Hi, the front of the queue is the first element in the array, so it should be:

Test.assertEquals(queueTime([2,2,10], 2), 12);
Test.assertEquals(queueTime([6,6,10], 2), 16);

Let me know if you have any further questions. I may add an example test case like these, as a few people seem to be having similar confusion.

thanks!