Leetcode 978. Longest Turbulent Subarray

Find the length of the longest contiguous subarray where the sign of each adjacent comparison strictly alternates (i.e., > then < then > ... or < then > then < ...). Note equal adjacent values break the turbulence so the subarray must consist of strictly alternating up/down comparisons.

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 978. Longest Turbulent Subarray

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact