Search
⌘K
Get Premium
Leetcode 229. Majority Element II
Find all elements in an integer array that appear more than ⌊n/3⌋ times (there can be at most two such elements). The challenge is to identify them in linear time and O(1) extra space (e.g., via an extension of the Boyer–Moore majority vote).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.