2.
Given an array of N points, with integer x and y coordinates (say, 64-bits),
describe (on the back of this page)
an efficient algorithm that to identify and remove all duplicates.
Your algorithm can use a sort method, but should otherwise run in linear time.
Give a crisp and concise English description of your algorithm - don't
write Java code.