Two answers here, one is more efficient as far as memory, i.e. sort first then compare neighbors, the second solution is to save values to a dictionary which is faster O(n), but expensive