Length of the Longest Subsequence That Sums to Target at Intuit

Problem Description

You are given a **0-indexed** array of integers `nums`, and an integer `target`. Return _the**length of the longest subsequence** of_ `nums` _that sums up to_ `target`. _If no such subsequence exists, return_ `-1`. A **subsequence** is an array that can be derived from another array by deleting so...

Topics

Also asked at 2 companies