Count subset queries
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.
Implement
count_supersets(nums: list[int], queries: list[int]) → list[int]Examples
in
[[2,3,6],[1,2]]out[1,3]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[2,3,6],[1,2]][1,3]not run yetsample