Given an integer array nums, determine the maximum possible bitwise OR value of any of its subsets. Return the number of non empty subsets that yield this maximum bitwise OR value.

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 distinct if they are formed by choosing elements from different indices of nums.

Constraints:

• $1 \leq$ nums.length $\leq 16$

• $1 \leq$ nums[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.