D. J.:

- Added the leetcode problem and solution for 3005

Author: nobodyPerfecZ

README.md

@@ -298,6 +298,7 @@
 - [2523 Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range/description/)
 - [2785 Sort Vowels in a String](https://leetcode.com/problems/sort-vowels-in-a-string/description/)
 - [2799 Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/description/)
+- [3005 Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/description/)
 - [3136 Valid Word](https://leetcode.com/problems/valid-word/description/)
 - [3202 Find the Maximum Length of Valid Subsequence II](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/description/)
 - [3392 Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/description/)

awesome_python_leetcode/_3005_count_elements_with_maximum_frequency.py

@@ -0,0 +1,35 @@
+import collections
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def maxFrequencyElements(self, nums: List[int]) -> int:
+        """
+        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.
+        """
+        # (num -> frequency)
+        num_to_frequency = collections.defaultdict(int)
+
+        # (frequency -> count)
+        frequency_to_count = collections.defaultdict(int)
+
+        # Count the frequency and the number of frequencies for the numbers
+        for n in nums:
+            if num_to_frequency[n] > 0:
+                frequency_to_count[num_to_frequency[n]] -= 1
+            num_to_frequency[n] += 1
+            frequency_to_count[num_to_frequency[n]] += 1
+
+        # Get the maximum frequency and the count of that frequency
+        max_frequency = max(num_to_frequency.values())
+        max_count = frequency_to_count[max_frequency]
+
+        return max_frequency * max_count

tests/test_3005_count_elements_with_maximum_frequency.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._3005_count_elements_with_maximum_frequency import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([1, 2, 2, 3, 1, 4], 4),
+        ([1, 2, 3, 4, 5], 5),
+    ],
+)
+def test_func(nums: List[int], expected: int):
+    """Tests the solution of a LeetCode problem."""
+    max_frequency = Solution().maxFrequencyElements(nums)
+    assert max_frequency == expected