Practice Sort Array by Increasing Frequency
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array of integers 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.
Source: Sort Array by Increasing Frequency on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,1,2,2,2,3]
Output
[3,1,1,2,2,2]
# Example 2
Input
nums = [2,3,1,3,2]
Output
[1,3,3,2,2]
# Example 3
Input
nums = [-1,1,-6,4,5,-6,1,4,1]
Output
[5,-1,4,4,-6,-6,1,1,1]
Constraints
1 <= nums.length <= 100
-100 <= nums[i] <= 100
Related LeetCode Problems
Practice more problems similar to Sort Array by Increasing Frequency.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.