Given an integer array nums and an integer k, return the sum of all elements in nums whose frequency in nums is divisible by k.

If no elements satisfy this condition, return $0$.

Constraints:

• $1 \leq$ nums.length $\leq 100$

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

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