Subset Sum to Target | Dataford Interview Questions

A PhysicsX simulation pipeline produces a vector of integer feature contributions. Given the vector and a target value, determine whether any subset of elements sums exactly to the target. Each element may be selected at most once, and the empty subset is allowed.

Because the vector can contain positive, negative, and zero values, avoid assumptions that would enable simple greedy or two-pointer methods. Design an algorithm suitable for vectors with up to 40 elements.

Formal Specification

Implement has_subset_sum(nums, target), where nums is a list of integers and target is an integer. Return True if at least one subset of nums has sum equal to target; otherwise return False.

Constraints

0 <= len(nums) <= 40
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Each element may be selected at most once
The empty subset is valid

Function Signature

def has_subset_sum(nums, target):

Your question is Subset Sum to Target. 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

Formal Specification

Constraints

0 <= len(nums) <= 40
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Each element may be selected at most once
The empty subset is valid

Function Signature

def has_subset_sum(nums, target):

Your question is Subset Sum to Target. 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.