Majority Element II
Given an integer array nums of size n, find all elements that appear more than ⌊n / 3⌋ times.
Follow up: Could you solve the problem in linear time and in O(1) space?
Example 1
Input
nums = [3,2,3]Output
[3]The element 3 appears 2 times, which is more than ⌊3 / 3⌋ = 1.
Example 2
Input
nums = [1]Output
[1]The only element 1 appears once, which is more than ⌊1 / 3⌋ = 0.
Constraints
- 1 <= nums.length <= 5 * 10^4
- -10^9 <= nums[i] <= 10^9
Asked at 10 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.