Faster than 95% using lambda function and sort
\nfrom collections import Counter\nclass Solution:\n    def frequencySort(self, nums: List[int]) -> List[int]:\n        \n        di=Counter(nums)\n        li=l
```\nfrom collections import Counter\nclass Solution:\n    def frequencySort(self, nums: List[int]) -> List[int]:\n        \n        di=Counter(nums)\n        li=list(di.items())\n        \n        #keep a list of frequency elements and their values[val,freq]\n        \n        li.sort(key=lambda x:(x[1],-x[0]))\n        \n        #LARGEST POSITIVE NUMBER IS SMALLEST NEGATIVE NUMBER\n        res=[]\n        for val,freq in (li):\n            res+=[val]*freq\n        return res\n\t\t\n```\n\tAfter making list of frequency and values, we sort the list using custom lambda function.\nIn case the frequency is same, the value is sorted in reverse(as we consider it a negative value).
['Sorting', 'Python', 'Python3']