The first question is the most difficult question in this round.
Interview Answers
Anonymous
Aug 6, 2014
Sort - O(nlogn)
and then traverse in O(n) and check if a[i]==a[i+1] if so delete a[i] since it is a duplication.
1
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)
Anonymous
Aug 22, 2014
Question is :
delete all the duplicate numbers in the array.