Count subset queries
Your task
You are given an array 'nums' of non-negative integers and a list of integer 'queries', all values strictly less than 2^16. For each query q, count how many elements x of nums are SUPERSETS of q at the bit level, meaning (x & q) == q (every set bit of q is also set in x). Return a list of counts, one per query in order. 1 <= len(nums) <= 50000, 1 <= len(queries) <= 50000.
Examples
count_supersets(nums: list[int], queries: list[int]) -> list[int]Example 1
Input
count_supersets([2, 3, 6], [1, 2])Output
[1, 3]