#### Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

#### Categories

Welcome to the new platform of Programmers Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use it's exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

# 5k+1 array

Posts: 1Member
Hi,

is there any linear time algorithm to solve this problem?

An array of length 5k+1 having k+1 distinct elements with k elements repeating 5 times each. The goal is to find the element which doesn't repeat.
Can we do this in linear time?

O(nlogn) algorithm is to sort the array using any of the standard sorting algorithms and then just find this element. Is there a linear time algo for this?

Thanks.
· ·

• Posts: 241Member
: Hi,
:
: is there any linear time algorithm to solve this problem?
:
: An array of length 5k+1 having k+1 distinct elements with k
: elements repeating 5 times each. The goal is to find the element
: which doesn't repeat.
: Can we do this in linear time?
:
: O(nlogn) algorithm is to sort the array using any of the standard
: sorting algorithms and then just find this element. Is there a
: linear time algo for this?
:
: Thanks.
:
Use a hash table to store your elements and the count. Then make a second pass over the hash to pick out the one with only one entry.
Hash tables can be designed to be practically O(1) for insertions.

· ·