Leetcode 376. Wiggle Subsequence

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.