We don't need repeats

It was hard. Hint: all for() loops must be on duplicates

This one I can't understand. Requirement number 4 clearly states that the removeFirstNameDuplicates() must remove from the map ALL the people who have the SAME first name. That is all the people not just duplicates. Yet it fails to validate when I do this. It validates correctly only if we remove the duplicates. This is a bit misleading, the wording of the requirements.

I made a "hadouken" to solve it. Make a copy for the original map and to much fors and ifs, the ugliest way, but it works.

I found it easier than the other difficult ones. I created two HashMap in removeFirstNameDuplicates, one copy of the map to iterate through it without having problems when we would remove elements from the original map and another to add the dupplicates in it. Then it's pretty straightforward.

-SUPER HINTS: - Only pass the "duplicated values" to removeItemFromMapByValue() method otherwise it will remove everithing. - when removing ((keep the method 1º parameter, and replace the 2º paramenter with the "key or value" that it's duplicated)) - remember: passing the node/set view/keyset won't work for the first parameter

Biggest mistake I made was forgetting that ALL KEYS of a hashmap are unique.

As someone mentioned, do look up Collections.frequency. It will make your life much more pleasant. Happy coding! :)

This was fun and challenging!

Couple of hints: The removeByValue Method will remove from the map any name passed in it as a value, NOTE: you are passing a map and a string. Second, remember you can not remove from the same map you are iterating. In few words, find out how many times a first name repeats, then remove those repeated more than 1. It is that simple

First answer I ever copy pasted. I gotta study up on HashMaps.