2.
Given an array of N points, with integer x and y coordinates (say, 64-bits),
describe an efficient algorithm to identify and remove all duplicates.
Your algorithm should run in O(N log N) time in the worst case.
Give a crisp and concise English description of your algorithm - don't
write Java code.