Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Check If a Number Is Majority Element in a Sorted Array
Coding
- Majority Element
Coding · Array · Boyer–Moore Majority Vote Algorithm · Counting
- Online Majority Element In Subarray
Coding
- Apply Transform Over Each Element in Array
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 229. Majority Element II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source