Solution: The Number of Good Subsets

Explore how to efficiently count good subsets in an integer array where no prime factor repeats in the product. Learn to apply dynamic programming combined with bitmasks to track prime factors, handle valid subsets, and optimize computations. This lesson teaches a method to solve subset problems with constraints on prime factors in JavaScript.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

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 $= [1, 2, 5, 6]$ , then:

$[2, 5]$ , $[1, 2, 5]$ , and $[6]$ are good subsets with products $2 \times 5 = 10$ , $1 \times 2 \times 5 = 10$ , and $2 \times 3 = 6$ , respectively.
$[2, 6]$ ...