Available question text
Count the subsets of nums whose product is a product of distinct primes (i.e., square-free with no repeated prime factors), modulo 1e9+7. With nums length up to 1e5 and values ≤30, the core challenge is using frequency compression and bitmask DP over the ≤10 primes ≤30 (treating 1s multiplicatively).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1994. The Number of Good Subsets
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source