Count Smaller Elements on Right | Dataford Interview Questions

Write a function to count, for each element, how many smaller elements appear to its right in an array.

Implement count_smaller(nums), where nums is a list of integers. Return a list where result[i] is the number of elements strictly smaller than nums[i] that occur at an index greater than i. Equal values are not counted. Aim for better than O(n²) time.

Constraints

0 <= nums.length <= 5000
-10^9 <= nums[i] <= 10^9
The result must contain exactly nums.length integers
Only strictly smaller elements are counted

Function Signature

def count_smaller(nums):

Your question is Count Smaller Elements on Right. 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

Write a function to count, for each element, how many smaller elements appear to its right in an array.

Constraints

0 <= nums.length <= 5000
-10^9 <= nums[i] <= 10^9
The result must contain exactly nums.length integers
Only strictly smaller elements are counted

Function Signature

def count_smaller(nums):

Your question is Count Smaller Elements on Right. 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.