CodingMediumcod-g369

Subject RecursionLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

You are given an integer array nums (length 1..20, each value 0..1000) and an integer target. By prefixing every element with either '+' or '-' and concatenating, you build an expression. Return the number of distinct sign assignments that make the expression evaluate to target. Return an integer.

Implement

find_target_sum_ways(nums: list[int], target: int) → int

Examples

in[[1,1,1,1,1],3]out5

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.