Return Subsets Sum to K
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
Subset of an array 'ARR' is a tuple that can be obtained from 'ARR' by removing some (possibly all) elements of 'ARR'.
The order of subsets is not important. The order of elements in a particular subset should be in increasing order of the index.
The first line of input contains an integer 'N', which denotes the size of the array. The second line contains 'N' single-space separated integers representing the elements of the array. The third line contains a single integer 'K', which denotes the integer to which the subsets should sum to.
For each test case, print single-space separated integers of a subset of 'ARR' having sum = 'K'. The output of each test case will be printed in a separate line.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= 'N' <= 16 - (10 ^ 6) <= ARR[i] <= (10 ^ 6) - 16 * (10 ^ 6) <= 'K' <= 16 * (10 ^ 6) Where ‘ARR[i]’ denotes the value for ‘ith’ element of the array ‘ARR’ and 'K' is the given sum. Time Limit: 1 sec.
Recursively generate all the subsets and keep track of the sum of the elements in the current subset.
Subsets can be generated in the following way. For every element of the array, there are 2 options:
- Include the element in the current subset : If we include the element in the current subset, then we decrease the value of ‘K’ by the value of the element.
- Do not include the element in the current subset : There is no effect on the value of ‘K’ and we can simply move onto the next element.
In any step, if the value of ‘K’ becomes 0, then we have found a subset which sums to ‘K’. We store all these subsets and return them.