1. initialize hashmap/dictionary 2. iterate through the list of players, and if the element is not in the dictionary add it as a key, with some arbitrary value. 3. else: del element simple of O(n) , O(n) solution