C++ Easy Solution || Beats 75%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> findLonely(vector<int>& nums) {\n        vector<int> ans;\n        unordered_map<int,int> mp;\n        for(int i=0;i<nums.size();i++)\n            mp[nums[i]]++;\n        for(auto it:mp)\n            if(mp.count(it.first-1)==0 && mp.count(it.first+1)==0 && it.second==1)\n                ans.push_back(it.first);\n        return ans;\n    }\n};\n```
['Array', 'Hash Table', 'Counting', 'C++']