problem229

README

< Previous 　　　　　　　　　　　　　　　　 Next >

229. Majority Element II (Medium)

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Note: The algorithm should run in linear time and in O(1) space.

Example 1:

Input: [3,2,3]
Output: [3]

Example 2:

Input: [1,1,1,3,3,2,2,2]
Output: [1,2]

Related Topics

[Array]

Similar Questions

1. Majority Element (Easy)
2. Check If a Number Is Majority Element in a Sorted Array (Easy)

Hints

Hint 1

How many majority elements could it possibly have?
Do you have a better hint? Suggest it!