Problem intelligence

Find the Maximum Length of a Good Subsequence II

HARD · 2 companies · Array · Dynamic Programming · Hash Table

Interview priority

60

medium

Target overlap

0/0

Recency

100

Trend

50

Frequency

84

Company observations

BNY Mellon30d83.7
BNY Mellon90d83.5
BNY Mellon6m83.1
BNY Mellonall64.2
Snowflakeall68.2

Why this score

recent activity100
unsolved100
high frequency84

Local progress

unseen

Open on LeetCode