Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3176. Find the Maximum Length of a Good Subsequence I
Find the longest subsequence (order preserved) of nums that has at most k adjacent unequal pairs (i.e., at most k transitions between different values). This is typically solved with dynamic programming tracking positions and remaining allowed transitions (and the last chosen value) to maximize subsequence length.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.