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.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.