welldone!

well needed some time to understand,
this is fkn genius ngl

That is short and effective solution, instead of looking for minimal and maximal values you gust sort array. And alghorithms of sorting usually work faster with almost sorted arrays. So your program may be one of the quickest, even if queues are very long.

my solution same as this, but i did not sort that result array ,so a little complect

GG, i had the same idea, but its the simple code, GGWP

What a fucking genius GG nice solution

The core idea is to place each customer in the queue with the shortest processing time of all the previous queues

Excellent work!!
Even if this code is incresing complexity with increaing no of tilts, the way of thinking is appreciable...

Small=Yes. Efficient/Clever = Eh. Not a big fan of using "sort" for every iteration. But fast nonetheless.

it's a nuke!

Respect. I had to think about it. Clever!

Bad complexity. Why even bother with sorting if you can simply scan list for the largest number?

Smart

I would say it matters more to complete the Kata by whatever means you are able to at the moment. We are all learning and of course there are always going to be others out there who are more experienced. It's part of what makes it fun! Took me 42 lines, by the way :)

No, this solution is BAD. If you wanna see a good one, look at this, or even (slightly) better, this.