X288: Recursion Programming Exercise: Subset Sum

Write a recursive function that takes a start index, array of integers,and a target sum, your goal is to find whether a subset of of the array of integers adds up to the target sum.

Examples:

groupSum(0, {2, 4, 8}, 10) -> true
Reset

Practice a different Java exercise