1741. Sort Array by Increasing Frequency
My accepted Python solution to LeetCode problem 1741, Sort Array by Increasing Frequency, running in 4ms.
- Difficulty: Easy
- Python
- Runtime 4ms
- Memory 17.5MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 4ms, memory 17.5MB, accepted 2025-12-30.
class Solution:
def frequencySort(self, nums: List[int]) -> List[int]:
from collections import Counter
count = Counter(nums)
return sorted(nums, key=lambda x: (count[x], -x))