How should I practice Subset Sum to Target?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Goldman Sachs phone screen problems in FastPrep.

Is Subset Sum to Target associated with Goldman Sachs?

FastPrep tags this as a Goldman Sachs phone screen coding practice problem when the problem catalog has that company and stage context.

Subset Sum to Target

Goldman Sachs● MediumNEW GRADPHONE SCREEN

Learn

Problem statement

You are given an array nums of signed integers and a signed integer target. Determine whether some subset of array indices has values summing exactly to target. Each index may be selected at most once, and the empty subset is allowed.

Return 1 if such a subset exists; otherwise return 0.

Function

hasSubsetSum(nums: int[], target: int) → int

Examples

Example 1

nums = [3,34,4,12,5,2]target = 9return = 1

Selecting 4 and 5 reaches the target 9.

Example 2

nums = [2,-4,7]target = 1return = 0

The possible non-empty sums are 2, -4, 7, -2, 9, 3, and 5, so no subset reaches 1.

Constraints

0 <= nums.length <= 30.
-10^9 <= nums[i], target <= 10^9.
Use 64-bit arithmetic for intermediate subset sums.