Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3201. Find the Maximum Length of Valid Subsequence I
Find the maximum-length subsequence whose adjacent sums all have the same parity — equivalently either all elements have the same parity or the subsequence strictly alternates parity. The challenge is to compute, while preserving order, the longest same-parity subsequence (all odds or all evens) or the longest parity-alternating subsequence and return the larger 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.