avatar Bite 5. Parse a list of names

In this Bite you will work with a list of names.

1. Write a function that accepts a list of names and title cases them and removes duplicates.

2. Next, sort the list in alphabetical descending order by surname.

3. Finally, find the shortest first name.

You can assume that the names in the list are single strings composed of two words: one given name and one surname.

Python built-ins will be very useful for solving these problems in very concise ways. Get it sorted!

Login and get coding
go back Beginner level
Bitecoin 2X

2638 out of 2905 users completed this Bite.
Will you be Pythonista #2639 to crack this Bite?
Resolution time: ~51 min. (avg. submissions of 5-240 min.)
Pythonistas rate this Bite 4.62 on a 1-10 difficulty scale.
» Up for a challenge? 💪

Focus on this Bite hiding sidebars, turn on Focus Mode.
We use Python 3.8