Leetcode 2044. Count Number of Maximum Bitwise-OR Subsets

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.