How should I practice Subset Sum Possible?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Apple online assessment problems in FastPrep.

Is Subset Sum Possible associated with Apple?

FastPrep tags this as a Apple coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Dynamic Programming

Subset Sum Possible

Learn this problem

● MediumAppleONSITE INTERVIEW

Problem statement

You are given an integer array arr and an integer target. Return true if some subset of arr has sum exactly target; otherwise return false.

Each array element may be used at most once.

Function

isSubsetSum(arr: int[], target: int) → boolean

Examples

Example 1

arr = [3,34,4,12,5,2]target = 9return = true

The subset [4,5] sums to 9.

The source shared the rule but did not include this exact sample. FastPrep added this small example so the behavior can be checked directly.

Problem statement

Function

Examples

Example 1

More Apple problems