Question

I need a help in making an algorithm for solving one problem: There is a row with numbers which appear different times in the row, and i need to find the number that appears the most and how many times it’s in the row, ex:

1-1-5-1-3-7-2-1-8-9-1-2

That would be 1 and it appears 5 times.

The algorithm should be fast (that’s my problem).
Any ideas ?

Answer 1

You could keep hash table and store a count of every element in that structure, like this

h[1] = 5
h[5] = 1
...