Available question text
Given a hidden array accessible only via a query API (e.g., compare elements or check equality), determine whether a value appears more than n/2 times and return an index of that majority element (or -1 if none). The core challenge is to infer the majority with limited queries efficiently using majority-vote style elimination and counting.
Related questions
Continue with questions that share topics or the same question type.
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 1538. Guess the Majority in a Hidden Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source