Available question text
Find the length of the longest subsequence of an array whose consecutive differences strictly alternate in sign (zeros don't count as a change). The core challenge is selecting elements (not necessarily contiguous) to maximize alternating up/down transitions — this can be solved by tracking up/down states in linear time.
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 376. Wiggle Subsequence
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source