Count the Number of Square-Free Subsets at Media.net

Medium26.4% acceptance

This problem has 100.0% frequency at Media.net.

Problem Description

You are given a positive integer **0-indexed** array `nums`. A subset of the array `nums` is **square-free** if the product of its elements is a **square-free integer**. A **square-free integer** is an integer that is divisible by no square number other than `1`. Return _the number of square-fre...

Read full problem and hints

Topics

Array Math Dynamic Programming Bit Manipulation Bitmask

Also asked at 1 company

Google

View Full Problem

More Media.net Questions

Minimum Total Space Wasted With K Resizing OperationsMedium Difference Between Maximum and Minimum Price SumHard Trapping Rain Water IIHard Maximum Genetic Difference QueryHard Maximum Value of an Ordered Triplet IIMedium

View all Media.net questions