Grokking the Coding Interview: Patterns for Coding Questions

Ask Author

Back to course home

0% completed

Problem Challenge 1: Count of Subset Sum (hard)

Problem Statement

Given a set of positive numbers, find the total number of subsets whose sum is equal to a given number ‘S’.

Example 1:

Input: {1, 1, 2, 3}, S=4
Output: 3
The given set has '3' subsets whose sum is '4': {1, 1, 2}, {1, 3}, {1, 3}
Note that we have two similar sets {1, 3}, because we have two '1' in our input.

Example 2:

Input: {1, 2, 7, 1, 5}, S=9
Output: 3
The given set has '3' subsets whose sum is '9': {2, 7}, {1, 7, 1}, {1, 2, 1, 5}

Constraints:

1 <= num.length <= 20
0 <= num[i] <= 1000
0 <= sum(num[i]) <= 1000

.....

.....

.....

Like the course? Get enrolled and start learning!