You are given an integer array nums of length n, along with two integers k and x.

The $x$ sum of an array is determined by the following process:

• Count the frequency of each distinct element in the array.

• Choose the top x most frequent elements. If two elements have the same frequency, the element with the greater value is preferred. If the array contains fewer than x distinct elements, choose all elements.

• Compute the sum of all occurrences of the chosen elements.

Return an integer array answer of length n $-$ k $+ 1$ where answer[i] represents the $x$ sum of the subarray nums[i..i + k - 1].

Constraints:

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

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

• $1 \leq$ x $\leq$ k $\leq$ nums.length

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.