You are given an integer array nums and an integer target.

Return the length of the longest subsequence of nums whose elements sum to target. If no such subsequence exists, return $-1$.

Constraints:

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

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

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