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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 376. Wiggle Subsequence

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact