Subset sum easy

Explaination need with recursive function base and induction step.

Hi divyam
We use a recursive function that calls for next element in array at each step by

  1. including in sum
  2. excluding in sum

The base case arrives when sum=0 at any particular element or we reach the end of array.

Hope it helps
Give a like if you’re satisfied :slight_smile:

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.