Sort Array by Increasing Frequency | Dataford Interview Questions

LeetCode 1636 Sort Array by Increasing Frequency.

Asked in the OA stage. Given an integer array nums, return a new array sorted by increasing frequency. If two values have the same frequency, place the larger value first.

Contract

Implement def frequency_sort(nums):. Return all elements with the same multiplicities as the input.

Constraints

1 <= len(nums) <= 100
-100 <= nums[i] <= 100
Return a new array containing exactly the input elements

Function Signature

def frequency_sort(nums):

Your question is Sort Array by Increasing Frequency. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem