Given an integer array nums and an integer target, assign either the symbol + or the symbol - to each element in nums, then evaluate the resulting expression by summing all signed values. Return the number of different symbol assignments whose total equals target.

Constraints:

• $1 \leq$ nums.length $\leq 20$

• $0 \leq$ nums[i] $\leq 1000$

• $0 \leq \sum$(nums[i]) $\leq 1000$

• $-1000 \leq$ target $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.