C++ Easy Solution || Using hashmap
\nclass Solution {\npublic:\n    vector<int> findLonely(vector<int>& nums) {\n        int n=nums.size();\n        unordered_map<int,int> ump;\n        vector<in
```\nclass Solution {\npublic:\n    vector<int> findLonely(vector<int>& nums) {\n        int n=nums.size();\n        unordered_map<int,int> ump;\n        vector<int> sol;\n        for(int i=0;i<n;i++)\n        {\n            ump[nums[i]]++;\n        }\n        for(auto a: ump)\n        {\n            if(a.second==1 and !ump.count(a.first+1) and !ump .count(a.first-1))\n                sol.push_back(a.first);\n        }\n\n        return sol;\n    }\n};\n```
['C']