</>OfferRetriever
DashboardDiscuss
NEW

July 4th Sale

Limited Time Deal: Unlock all premium questions for over 40% off

$10.42$6.25

10

:

09

:

25

:

40

Get this deal
Back to Dashboard

Prime Subset Products

Hard

Given an array primes where every element is a prime number (duplicates are allowed), find all distinct products that can be formed by multiplying the elements of any non-empty subset.

Return the results as a sorted list with no duplicates. ...