Longest Harmonious Subsequence
We define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1.
Given an integer array nums, return the length of its longest harmonious subsequence among all its possible subsequences.
Example 1
Input
nums = [1,3,2,2,5,2,3,7]Output
5The longest harmonious subsequence is [3, 2, 2, 2, 3].
Example 2
Input
nums = [1,2,3,4]Output
2The longest harmonious subsequences are [1, 2], [2, 3], and [3, 4], all of which have a length of 2.
Constraints
- 1 <= nums.length <= 2 * 10^4
- -10^9 <= nums[i] <= 10^9
Asked at 7 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.