Skip to content

Practice Count Number of Maximum Bitwise-OR Subsets

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2044
LeetCode Problem

Count Number of Maximum Bitwise-OR Subsets

Problem Statement

Given an integer array nums, find the maximum possible bitwise OR of a subset of nums and return the number of different non-empty subsets with the maximum bitwise OR. An array a is a subset of an array b if a can be obtained from b by deleting some (possibly zero) elements of b. Two subsets are considered different if the indices of the elements chosen are different. The bitwise OR of an array a is equal to a[0] OR a[1] OR ... OR a[a.length - 1] (0-indexed).

Source: Count Number of Maximum Bitwise-OR Subsets on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [3,1]
Output
2

# Example 2

Input
nums = [2,2,2]
Output
7

# Example 3

Input
nums = [3,2,1,5]
Output
6

Constraints

1 <= nums.length <= 16
1 <= nums[i] <= 10^5

Related LeetCode Problems

Practice more problems similar to Count Number of Maximum Bitwise-OR Subsets.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.