Partition equal subset sum count
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) → intExamples
in
[[1,1,1,1,1],3]out5What 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.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,1,1,1,1],3]5not run yetsample