Subset sum probklem question

#1

i want answer of this question using Dp.
i m not able to find it.

#2

Hello @anujkurmi,

Considering that you are asking about THE SUBSET SUM TO TARGET,

DP approach:

isSubsetSum(set, n, sum) = isSubsetSum(set, n-1, sum) || isSubsetSum(set, n-1, sum-set[n-1])
Base Cases:
isSubsetSum(set, n, sum) = false, if sum > 0 and n == 0
isSubsetSum(set, n, sum) = true, if sum == 0

Refer to this code only, if you are stuck:

Now, try to implement it yourself.

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.