Given an integer array nums, compute the frequency of each distinct value. Let the maximum frequency among all values be the largest count of any value in nums. Return the total number of elements in nums whose values occur with this maximum frequency.

Note: The returned value is the sum of frequencies of all distinct values that tie for the maximum frequency.

Constraints:

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

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