Removing Duplicates in O(k) time

pavankumar.thati's Avatar, Join Date: Jul 2008
Newbie Member
An array of size k contains integers between 1 and n. Compress the original array by removing duplicates in it. What if k << n?
xpi0t0s's Avatar, Join Date: Aug 2004
Duplicate of
You said in that post you'd already solved it. Are you heading backwards through time?
shabbir's Avatar, Join Date: Jul 2004
Go4Expert Founder
Thread Closed.