Recursive Subset Sum | Dataford Interview Questions

Given an array and a number, how would you determine whether some elements sum to the given number using only recursion?

Write a function that returns True if any subset of the input array sums exactly to target, otherwise return False. Use recursion only, no loops or iterative dynamic programming.

Function signature

subset_sum(nums, target)

Input

nums: list of integers
target: integer

Output

Return a boolean.

Constraints

0 <= len(nums) <= 30
-10^4 <= nums[i] <= 10^4
-10^5 <= target <= 10^5
Use recursion only, no iterative subset-sum DP

Function Signature

def subset_sum(nums, target):

Your question is Recursive Subset Sum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem