 All Problems
Wiggle Subsequence
medium
array
greedy
dynamic programming
google
bloomberg

A wiggle sequence is a sequence where the differences between successive numbers strictly alternate between positive and negative.

Given an integer array nums, return the length of the longest wiggle subsequence.

Example 1:

Input: nums = [1,7,4,9,2,5]
Output: 6

Example 2:

Input: nums = [1,17,5,10,13,15,10,5,16,8]
Output: 7

Constraints:

  • 1 <= nums.length <= 1000
  • 0 <= nums[i] <= 1000
Run to check your code against the sample cases, or submit to run every case