Spring Hire Sale
Limited Time Deal: Unlock all premium questions for over 30% off
$10.42$7.08
08
:
04
:
45
:
31
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. ...