Today I have done leetcode's September LeetCoding Challenge with cpp.

September LeetCoding Challenge 22

Description

Count Elements With Maximum Frequency

You are given an array nums consisting of positive integers.

Return the total frequencies of elements in nums such that those elements all have the maximum frequency.

The frequency of an element is the number of occurrences of that element in the array.

Example 1:

Input: nums = [1,2,2,3,1,4]
Output: 4
Explanation: The elements 1 and 2 have a frequency of 2 which is the maximum frequency in the array.
So the number of elements in the array with maximum frequency is 4.

Example 2:

Input: nums = [1,2,3,4,5]
Output: 5
Explanation: All elements of the array have a frequency of 1 which is the maximum.
So the number of elements in the array with maximum frequency is 5.

Constraints:

• 1 <= nums.length <= 100
• 1 <= nums[i] <= 100

Solution

class Solution {
public:
  int maxFrequencyElements(vector<int>& nums) {
    int count[100] = {};
    int ccount[101] = {};
    for(auto n : nums) {
      count[n - 1] += 1;
    }
    for(int i = 0; i < 100; ++i) {
      ccount[count[i]] += 1;
    }
    for(int i = 100; i > 0; --i) {
      if(ccount[i]) return i * ccount[i];
    }
    return -1;
  }
};

// Accepted
// 623/623 cases passed (0 ms)
// Your runtime beats 100 % of cpp submissions
// Your memory usage beats 10 % of cpp submissions (23.4 MB)