int findLHS(vector<int>& nums) {
    unordered_map<int,int> m;
    for(auto e:nums){
        m[e]++;
    }
    int maxLen=0;
    // for(auto &[x,y]:m){
    //     cout << x << " " << y << endl;
    // }
    for(auto it=m.begin();it!=m.end();it++)
    {
        int ele=it->first;
        cout<<ele<<" ";
        if(m.count(ele-1))
            maxLen=max(maxLen,(m[ele]+m[ele-1]));
        if(m.count(ele+1))
            maxLen=max(maxLen,(m[ele]+m[ele+1]));

    }
    return maxLen;

}