How do you approach Target Sum?

Let P be the positive subset; then sum(P) = (total + target) / 2.

What are common mistakes on Target Sum?

Iterating the dimensions in an order that reads a cell before it has been written. Getting the base case wrong. It carries the whole recurrence, and the error stays invisible until a large input. Rolling down to one dimension without reversing the inner loop, which lets a 0/1 item be taken twice.

gitGood.dev

← Back to problems

Target Sum

MediumAlgorithms

Description

Given an integer array `nums` and an integer `target`, you assign a `+` or `-` sign to each number and concatenate them into an expression. Return the number of ways the expression evaluates to `target`.

Example 1

Input: nums = [1,1,1,1,1], target = 3

Output: 5

Explanation: Five sign assignments reach 3.

Constraints

- 1 <= nums.length <= 20 - 0 <= nums[i] <= 1000 - -1000 <= target <= 1000

Target Sum: approach, complexity and pitfalls

A medium dynamic programming problem, graded against 4 test cases (2 of them hidden).

The pattern: Dynamic Programming

Overlapping subproblems solved once and reused - the pattern candidates fear most.

Reach for it when you see: "Number of ways", "minimum/maximum cost", or a recursion that recomputes the same state.

More Dynamic Programmingproblems →

If you are stuck

Show the 2-step hint ladder

Let P be the positive subset; then sum(P) = (total + target) / 2.
Count subsets summing to that value with a 0/1-knapsack DP.

The optimal approach

Show the approach: The approach

Reduce to subset-sum counting. If the positive-signed elements sum to `s`, then `s = (total + target) / 2`. If that isn't a non-negative integer, the answer is 0. Otherwise count subsets summing to `s` via a 1-D knapsack.

Time: O(n·s). Space: O(s).

The full reference solution in every supported language stays in the editor above - reveal it there once you have had a real attempt.

What the tests check

Read off this problem's own test suite, so these are the cases a submission actually has to survive.

Single element. A one-element case is included. Two-pointer and window solutions frequently return the wrong thing when the two indices start out equal.
Duplicate values. Repeated values appear in the input, so any logic that assumes distinct elements - or that skips over equal neighbours - is exercised.
Zero. Zero appears in the input, which is the value most likely to break a truthiness check used in place of an explicit comparison.

Common Dynamic Programming mistakes

These apply to the pattern as a whole, not just this problem.

Iterating the dimensions in an order that reads a cell before it has been written.
Getting the base case wrong. It carries the whole recurrence, and the error stays invisible until a large input.
Rolling down to one dimension without reversing the inner loop, which lets a 0/1 item be taken twice.