You're managing a manufacturing system where each part is labeled with a positive integer. A combination of parts is considered safe if the product of their labels is a square-free number—i.e., not divisible by any perfect square greater than 1.

Given a 0-indexed array nums representing available parts, return the number of non-empty safe subsets you can form. Two subsets are different if they differ by at least one index.

pretty much same as - https://leetcode.com/problems/count-the-number-of-square-free-subsets/

hint - use subset logic with bit manipulation

verdict : moved to onsites