Bite 5. Parse a list of namesIn this bite you will work with a list of names.
First you will write a function to take out duplicates and title case them.
Then you will sort the list in alphabetical descending order by surname and lastly determine what the shortest first name is. For this exercise you can assume there is always one name and one surname.
With some handy Python builtins you can write this in a pretty concise way. Get it sorted :)
979 out of 1076 users completed this Bite.
Will you be Pythonista #980 to crack this Bite?
It takes an average of ~47 minutes to solve this Bite (submissions 5-240 min).
Pythonistas rate this Bite 4.48 on a 1-10 difficulty scale.
» Up for a challenge? 💪