Question

i know that it isnot math but can anyone help with recursion

Answer 1

bool subsetSumExists(Set<int> & set, int target) {
if (set.isEmpty()) {
return target == 0;
} else {
int element = set.first();
Set<int> rest = set - element;
return subsetSumExists(rest, target)
|| subsetSumExists(rest, target - element);
}
}

Answer 2

@ganeshie8

Answer 3

it not easy one

Answer 4

i need backtracking

Answer 5

@whpalmer4

Answer 6

@rebeccaxhawaii

Answer 7

@FaiqRaees