X276: 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 the array of integers adds up to the target sum. The start index is initially 0.
A target sum of 0 is true for any array.

Examples:

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

Your Answer:

Reset

Feedback

Your feedback will appear here when you check your answer.