Problem intelligence

Length of the Longest Subsequence That Sums to Target

MEDIUM · 3 companies · 0-1 Knapsack · Array · Dynamic Programming · Knapsack Problem

Interview priority

46

medium

Target overlap

0/0

Recency

30

Trend

50

Frequency

72

Company observations

Amazonolder8.9
Amazonall10.3
Intuitall72.1
Metaolder8.7
Metaall8

Why this score

unsolved100
high frequency72

Local progress

unseen

Open on LeetCode