4.5

O(nlogn) solution:

sort the array first,

scan the array, keep updating a max_so_far counter.

O(n) solution:

put each value into hash map with the value as key and frequency as value

scan the hash map to find the max

Back to Chapter 4