LeetCode 315 Count of Smaller Numbers After Self - Problem Statement

Input: Integer array.

Output: For each element, count of smaller elements to its right.

Example: [5,2,6,1] → [2,1,1,0].

Constraints: $1 \le$ nums.length $\le 10^5$.