Solution: The Number of Good Subsets
Solution: The Number of Good Subsets asks you to count array subsets whose product is a product of distinct primes. Different indexes create distinct subsets; return the count modulo a large prime.
We'll cover the following...
We'll cover the following...
Statement
For a given integer array, nums, you can say that a subset of nums is called “good” if the product of its elements can be expressed as a product of one or more distinct prime numbers, i.e., no prime factor appears more than once.
For example, if nums
, , and are good subsets with products , , and , respectively. ...