Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.
- How many majority elements could it possibly have?
- Do you have a better hint? Suggest it!
Show Tags Array
Show Similar Problems (E) Majority Element