how to find the count of an element which repeats maximum number of times in an array if the array contains both positive and negative elements in most efficient way ?
in O(n)?
↧
COUNT OF MAXIMUM REPEATING ELEMENT IN THE ARRAY
↧