singly linked list counting algorithm : I need to write a metod that goes over a sorted singly linked list and returns
the numer that appears the most times but goes over the list only one time

can someone point me in the right direction?
can't find an elegent solution yet, should i use recursion?
I want the code to be as efficient as possible

thanks in advance