PYTHON EASY SOLUTION [100%] FASTER
\'\'\'\n\n    def findLonely(self, nums: List[int]) -> List[int]:\n        \n        d={}\n        l1=[]\n        for i in nums:  \n            if i not in d:\n
\'\'\'\n\n    def findLonely(self, nums: List[int]) -> List[int]:\n        \n        d={}\n        l1=[]\n        for i in nums:  \n            if i not in d:\n                d[i]=1\n            else:                       # count the repetitive elements\n                d[i]+=1\n                \n        for key,value in d.items():\n            if value==1 :                           #if count is 1 and key-1 and key+1 is not present then append key\n                if key-1 not in d and key+1 not in d:\n                    l1.append(key)\n        return l1\n\'\'\'
['Python']