You are given a $0$ indexed integer array nums of length n.

The distinct difference array of nums is an array diff of length n where each element diff[i] is equal to the number of distinct elements in the prefix from index $0$ to i minus the number of distinct elements in the suffix from index i $+ 1$ to n $- 1$.

Return the array diff.

Note: The prefix includes the element at index i, whereas the suffix does not. When i is equal to n $- 1$, the suffix is empty and contains $0$ distinct elements.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 50$

• $1 \leq$ nums[i] $\leq 50$

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.