Given a set of elements and a sum value, you need to find out all subsets of elements equal to the sum of value through backtracking. Set of elements = {5,8,6,7,6,10,5} Sum = 20
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 == 0Given a set of elements and a sum value, you need to find out all subsets of elements equal to the sum of value through backtracking. Set of elements = {5,8,6,7,6,10,5} Sum = 20
if (A[i-1] > j)
DP[i][j] = DP[i-1][j]
else
DP[i][j] = DP[i-1][j] OR DP[i-1][j-A[i-1]]Given a set of elements and a sum value, you need to find out all subsets of elements equal to the sum of value through backtracking. Set of elements = {5,8,6,7,6,10,5} Sum = 20
Input : arr[] = {2, 3, 5, 6, 8, 10}
sum = 10
Output : 5 2 3
2 8
10
Input : arr[] = {1, 2, 3, 4, 5}
sum = 10
Output : 4 3 2 1
5 3 2
5 4 1Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
