How should I practice Sort Array by Increasing Frequency?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Sort Array by Increasing Frequency associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Sort Array by Increasing Frequency

Bloomberg LP● EasyNEW GRADPHONE SCREEN

Learn

Problem statement

Given an integer array nums, sort it by increasing value frequency. When two values have the same frequency, place the larger value first. Return the sorted array.

Function

frequencySort(nums: int[]) → int[]

Examples

Example 1

nums = [1,1,2,2,2,3]return = [3,1,1,2,2,2]

Frequencies are one, two, and three respectively.

Example 2

nums = [2,3,1,3,2]return = [1,3,3,2,2]

Two and three tie in frequency, so the larger value three comes first.

Constraints

1 <= nums.length <= 10^5.
-10^5 <= nums[i] <= 10^5.