Removing Duplicates in O(k) time

Newbie Member
21May2010,17:55   #1
pavankumar.thati's Avatar
An array of size k contains integers between 1 and n. Compress the original array by removing duplicates in it. What if k << n?
Mentor
22May2010,22:56   #2
xpi0t0s's Avatar
Duplicate of http://www.go4expert.com/showthread....8265#post68265
You said in that post you'd already solved it. Are you heading backwards through time?
Go4Expert Founder
23May2010,09:27   #3
shabbir's Avatar
Thread Closed.