Apparently it does >:(

I'm guessing it's because it's strictly following the principle of single responsibility. Every function does exactly one thing. But idk, doesn't look great to me.

You're right, this is a bloated solution. Some people seem impressed by this kind of thing.

donio95, because soriting takes O(n*log(n)) time, finding the minimum takes O(n) time.

sekulski, why is it have greater computational complexity than list of lens?

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

Keep trying!

that is where i am stuck as well :)

That's why it's 5 kyu, because the slicing is part of the a problem. Although it's not that difficult as it seems at first :-)

read the comments below.

It says, last name (ascending) and when they have the same last name, sort those by first name (also ascending).

;)

you guessed right. ;)

(but I added a spoiler flag to your message. ;p )