Design an algorithm that, given a list of n elements in an array, finds all the elements that appear more than n/3 times in the list. The algorithm should run in linear time ( n =0 ). You are expected to use comparisons and achieve linear time. No hashing/excessive space/ and don't use standard linear time deterministic selection algorithm.

Question

Design an algorithm that, given a list of n elements in an array, finds all the elements that appear more than n/3 times in the list. The algorithm should run in linear time ( n >=0 ). You are expected to use comparisons and achieve linear time. No hashing/excessive space/ and don't use standard linear time deterministic selection algorithm.

Accepted Answer

Algorithm to find elements appearing more than n/3 times in an array in linear time

Divide the array into three equal parts
Iterate through the array and count the occurrences of each element in each part
Check if the count of any element is greater than n/3
Return the elements that meet the condition

Asked in Cisco

Top Electronic Packaging Designer Interview Questions Asked at Cisco