Dsa
Arrays
Medium
Array Subset Product
Given an array of integers, find all unique subsets and compute their products. Return the largest product among them. Input: The first line contains an integer n (1 <= n <= 20). The second line contains n integers (elements of the array). Output: A single integer representing the largest product of any subset. Example:
Input:
3
1 2 3
Output:
6
Key concepts
arraysproductsubset
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now