An array of size k contains integers between 1 and n. Compress the original array by removing duplicates in it in O(k) time What if k << n?
HCL, Microsoft, Veritas,