1. We have moved from vBulletin to XenForo and you are viewing the site in the middle of the move. Though the functional aspect of everything is working fine, we are still working on other changes including the new design on Xenforo.
    Dismiss Notice

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

    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

  3. shabbir

    shabbir Administrator Staff Member

    Thread Closed.
Thread Status:
Not open for further replies.

Share This Page