1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.

Removing Duplicates in O(k) time

Discussion in 'Engineering Concepts' started by pavankumar.thati, May 21, 2010.

Thread Status:
Not open for further replies.
  1. pavankumar.thati

    pavankumar.thati New Member

    Joined:
    Jul 9, 2008
    Messages:
    4
    Likes Received:
    0
    Trophy Points:
    0
    An array of size k contains integers between 1 and n. Compress the original array by removing duplicates in it. What if k << n?
     
  2. xpi0t0s

    xpi0t0s Mentor

    Joined:
    Aug 6, 2004
    Messages:
    3,012
    Likes Received:
    203
    Trophy Points:
    0
    Occupation:
    Senior Support Engineer
    Location:
    England
  3. shabbir

    shabbir Administrator Staff Member

    Joined:
    Jul 12, 2004
    Messages:
    15,283
    Likes Received:
    364
    Trophy Points:
    83
    Thread Closed.
     
Thread Status:
Not open for further replies.

Share This Page