Given an array of distinct integers nums and an integer target, return the total number of possible combinations that sum up to target.

Note: Different ordered sequences of integers that sum to target are counted as distinct combinations.

Constraints:

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

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

• All the elements of nums are unique.

• $1 \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.