Length of the Longest Subsequence That Sums to Target: coding question

Available question text

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).

Continue with questions that share topics or the same question type.

Length of Longest Fibonacci Subsequence
Coding
Bitwise OR of All Subsequence Sums
Coding
Construct Target Array With Multiple Sums
Coding
Find All Combinations of Bag Sizes That Sum to a Target Capacity
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Booze Allen Hamilton
Leetcode 2915. Length of the Longest Subsequence That Sums to Target
Reported May 29, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source

Length of the Longest Subsequence That Sums to Target

Available question text

Related questions

Length of the Longest Subsequence That Sums to Target

Available question text

Related questions