Time: 50 ms (55.36%), Space: 16.6 MB (37.68%) - LeetHub

Author: hogan-tech

1636-sort-array-by-increasing-frequency/1636-sort-array-by-increasing-frequency.py

@@ -0,0 +1,13 @@
+# time complexity: O(nlogn)
+# space complexity: O(n)
+from typing import Counter, List
+
+
+class Solution:
+    def frequencySort(self, nums: List[int]) -> List[int]:
+        freq = Counter(nums)
+        return sorted(nums, key=lambda x: (freq[x], -x))
+
+
+nums = [1, 1, 2, 2, 2, 3]
+print(Solution().frequencySort(nums))