Longest Harmonious Subsequence Problem Statement

Determine the longest harmonious subsequence within a given array of integers, where the difference between the maximum and minimum elements of the subsequence is exactly 1.

Example:

Input:

ARR = [3, 4, 3, 3, 3, 3, 4]

Output:

7

Explanation:

The sequence [3, 4, 3, 3, 3, 3, 4] is harmonious since the maximum value (4) and the minimum value (3) differ by 1.

Constraints:

1

Question

Longest Harmonious Subsequence Problem Statement

Determine the longest harmonious subsequence within a given array of integers, where the difference between the maximum and minimum elements of the subsequence is exactly 1.

Example:

Input:

ARR = [3, 4, 3, 3, 3, 3, 4]

Output:

Explanation:

The sequence [3, 4, 3, 3, 3, 3, 4] is harmonious since the maximum value (4) and the minimum value (3) differ by 1.

Constraints:

1 <= T <= 100
1 <= N <= 10^4
1 <= ARR[i] <= 10^8
Time limit: 1 sec

Accepted Answer

Find the longest harmonious subsequence in an array where the difference between max and min elements is 1.

Iterate through the array and count the frequency of each element.
For each element, check if the count of element+1 is greater than 0, if so, update the length of the harmonious subsequence.
Return the maximum length found.