Available question text
Compute the integer whose bit j is 1 iff at least k elements of nums have bit j set — equivalently, count ones per bit position and set bits with count >= k. Constraints: n ≤ 50 and nums are 31-bit nonnegative integers.
Related questions
Continue with questions that share topics or the same question type.
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Find All Duplicates in an Array
Coding
- Find All K-Distant Indices in an Array
Coding
- Find All Lonely Numbers in the Array
Coding · Array · Counting · Hash Table
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 2917. Find the K-or of an Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source