Given an integer array nums, determine the number of elements in the array that are strictly smaller than each nums[i]. That is, for each index i, count the number of valid indices j such that j != i and nums[j] < nums[i].

Return the answer in an array.

Constraints:

• $2 \leq$ nums.length $\leq 500$

• $0 \leq$ nums[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.