You will write three small functions that search a list of famous missions.
The idea. Each mission is a tuple (name, year, who sent it, where it went). A loop can count missions, pick the earliest one, or collect the names that match.
Your tasks.
count_to, return how many missions went to place.first_to, return the name of the earliest mission that went to place.sent_by, return a list of the names of the missions sent by who, in the order of the list.Run your code once to unlock the worked solution.
Have you tried it?
Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.
Log in to join the discussion.
Loading…