Microsoft Interview Question
The first question is the most difficult question in this round.
Interview Answers
Anonymous
Feb 7, 2015
O(n) solution go through each item in the array, check if the item is in the map, if its not in the map, add it in, if it is in the map, delete it (because it already exists)