FastPrep
Problem · Array

Items Sort

Learn this problem
● EasyAkuna Capital logoAkuna CapitalINTERNOA

Problem statement

Given an array of n item values, sort the array in ascending order, first by the frequency of each value, then by the values themselves.

Function

itemsSort(items: int[]) → int[]

Complete the function itemsSort in the editor below.

itemsSort has the following parameter(s):

  1. int items[n]: the array to sort

Returns

int[n]: the sorted array

Examples

Example 1

items = [4, 5, 6, 5, 4, 3]return = [3, 6, 4, 4, 5, 5]

There are 2 values that occur once: [3, 6].
There are 2 values that occur twice: [4, 4, 5, 5].
The array of items sorted by frequency and then by value in ascending order is [3, 6, 4, 4, 5, 5].

Constraints

1 ≤ n ≤ 2 x 105
1 ≤ items[i] ≤ 106

More Akuna Capital problems

drafts saved locally
public int[] itemsSort(int[] items) {
  // write your code here
}
items[4, 5, 6, 5, 4, 3]
expected[3, 6, 4, 4, 5, 5]
checking account