carynkeffer / office_mates_enumerables Goto Github PK

Clone this repo & complete the following activities:

Write code to:

1. Find the youngest office mate.
2. Get the person with the longest name.
3. Sort them by age.
4. Check if all their names start with an "M"
5. Check if any of them are younger than 21.
6. Sort them by last letter of their name, descending (should be "Kevin", "Pam", "Jim", "Michael", "Angela").
7. Check if there is ONE OfficeMate who is named "Michael" and older than 30 (should return true.)

The tests are written for you. Un-skip as needed.