Available question text
Given an array nums (n ≤ 16), determine the maximum bitwise OR value obtainable from any non-empty subset and return how many distinct index-based non-empty subsets achieve that maximum. The small n allows exploring all subsets or using DP over OR states to compute the max OR and count occurrences.
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 2044. Count Number of Maximum Bitwise-OR Subsets
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source