Leetcode 2915. Length of the Longest Subsequence That Sums to Target

Find the maximum length subsequence of positive integers that sums exactly to target (or return -1 if none exists). This is a 0/1 knapsack–style problem: choose a subset in order that maximizes item count under the sum constraint (feasible with DP given nums.length and target ≤ 1000).