Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1636 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1636 # by problem number
lcpy gen -s sort_array_by_increasing_frequency # by problem name
nums, sort the array in increasing order based on the frequency of the values. If multiple values have the same frequency, sort them in decreasing order.
Return the sorted array.
Input: nums = [1,1,2,2,2,3]
Output: [3,1,1,2,2,2]
Explanation: '3' has a frequency of 1, '1' has a frequency of 2, and '2' has a frequency of 3.
Input: nums = [2,3,1,3,2]
Output: [1,3,3,2,2]
Explanation: '2' and '3' both have a frequency of 2, so they are sorted in decreasing order.
Input: nums = [-1,1,-6,4,5,-6,1,4,1]
Output: [5,-1,4,4,-6,-6,1,1,1]
1 <= nums.length <= 100-100 <= nums[i] <= 100from collections import Counter
class Solution:
# Time: O(n log n)
# Space: O(n)
def frequency_sort(self, nums: list[int]) -> list[int]:
counts = Counter(nums)
return sorted(nums, key=lambda num: (counts[num], -num))
| Time | Space |
|---|---|
| O(n log n) | O(n) |