Skip to content

Latest commit

 

History

History
16 lines (13 loc) · 586 Bytes

File metadata and controls

16 lines (13 loc) · 586 Bytes

Problem 18: Cardinal Comparison (Count of Smaller Numbers After Self)

Problem Statement

Given an integer array nums, return an integer array counts where counts[i] is the number of smaller elements to the right of nums[i].

Input Format

  • An integer array nums.

Example

Input: nums = [5, 2, 6, 1]
Output: [2, 1, 1, 0]
Explanation:

  • To the right of 5, there are 2 smaller elements: 2 and 1.
  • To the right of 2, there is 1 smaller element: 1.
  • To the right of 6, there is 1 smaller element: 1.
  • To the right of 1, there are 0 smaller elements.