Return Subsets Sum to K Problem Statement
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
Explanation:
A subset of an array 'ARR' is a tuple that can be obtained from 'ARR' by removing some (possibly all) elements of 'ARR'.
Note:
- The order of subsets is not important.
- The order of elements in a particular subset should be in increasing order of the index.
Input:
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.
Output:
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.
Example:
Input:
3
1 2 3
3
Output:
1 2
3
Constraints:
- 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.
AnswerBot
6d
Return all subsets of an array that sum to a given integer K.
Use recursion to generate all possible subsets of the array.
Keep track of the current subset and its sum while traversing the array.
If the ...read more
Help your peers!
Add answer anonymously...
Top Avalara Technologies Software Developer interview questions & answers
Popular interview questions of Software Developer
>
Avalara Technologies Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app