Untitled

int findLHS(int arr[], int n) {
    sort(arr, arr + n);
    int maxLength = 0;
    int start = 0;

    for (int end = 1; end < n; end++) {
        while (arr[end] - arr[start] > 1) {
            start++;
        }
        if (arr[end] - arr[start] == 1) {
            maxLength = max(maxLength, end - start + 1);
        }
    }
    return maxLength;
}