PYTHON | HASHMAP O(N) Time, O(N) Space
PYTHON\n\nclass Solution:\n    def findLonely(self, nums: List[int]) -> List[int]:\n        n = len(nums)\n        hm = {}\n        for i in range(n):\n        
**PYTHON**\n```\nclass Solution:\n    def findLonely(self, nums: List[int]) -> List[int]:\n        n = len(nums)\n        hm = {}\n        for i in range(n):\n            if nums[i] in hm:\n                hm[nums[i]] += 1\n            else:\n                hm[nums[i]] = 1\n        answer = []\n        for i in range(n):\n            if (nums[i] - 1) not in hm:\n                if (nums[i] + 1) not in hm:\n                        if hm[nums[i]] == 1:\n                            answer.append(nums[i])\n        return answer\n```
['Array', 'Python']