This solution is not working anymore now !

Hi, I wonder if this would pass the current test set where there's "0" at the index position 0 (which you skip), which should appear in the resultset.

I think this is a really clever solution but not a best practice because it is not imediatly apparent how it works. Following zen of python rules 'explicit is better than implicit'

What this does it

1. Remove duplicates
2. Keeps the order

For those who are wondering!

I think you're right, it only seems to works in Python 3.6.0.

read the comments below.

I can't seem to get this solution to work. I copy pasted it, and it still produces roughly random orderings of the result.

I'm still very new to to time complexities, so I apologize if this is wrong, but when you say O(N^3) do you mean O(N * M^2) where N = number of customers and M = number of queues? In that case things wouldn't be too bad as long as we can assume that there aren't too many queues, right?

Agreed. It would be awesome if we could see which languages we've completed a kata in at a glance – ideally from the main list.