Sir , I am not able to find the approach

#1

Sir, please provide some hint so that I can solve this problem.

#2

@kodivine0
Algorithm :

  • Sort the array(non-decreasing).
  • First remove all the duplicates from array.
  • Then use recursion and backtracking to solve the problem.
      1. If at any time sub-problem sum == 0 then add that array to the result (vector of vectors).
      1. Else if sum if negative then ignore that sub-problem.
      1. Else insert the present array in that index to the current vector and call the function with sum = sum-ar[index] and index = index, then pop that element from current index (backtrack) and call the function with sum = sum and index = index+1

try now if facing problems will refer you to editorial code
if cleared hit like and mark resolved :smiley:

#3

if we remove the duplicates, then for the given example, how will we get the required o/p?

#4

@kodivine0 if you are having trouble with this app refer this


simple include exclude like subsequences
map is used so in final ans no duplicates there

#5

what is map? we have not been taught…

#6

@kodivine0 it would be better if you attempt this question after studying map.
just do it without map for now (map is just used for printing order and duplicates)
even the editorial contain set and maps

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.