Sum it up backtracking question

#1

could you please explain th algo of the problem? like how can i make the subarray for th equestion?

#2

Hello @Vibhuti0206,

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).
  2. Else if sum if negative then ignore that sub-problem.
  3. 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

Hope, this would help.
Give a like, if you are satisfied.

#3

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.