← Flipkart questions

Count Distinct Subset Sums

Filed under Flipkart

Given an array of large integers, calculate the total number of unique subset sums that can be formed by taking subsets of the array elements.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Flipkart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.