You are given an integer array nums and an integer k.

The mode of a subarray is the element with the highest frequency in that subarray. If multiple elements share the maximum frequency, the mode is the smallest element among them.

The weight of a subarray is calculated as the product of its mode and the frequency of that mode within the subarray.

Return the total sum of the weights across all contiguous subarrays of length k.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^5$

• $1 \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.