From eb45b2c32bb3294f73b47d796a818e7877da8d31 Mon Sep 17 00:00:00 2001
From: Libin YANG <contact@yanglibin.info>
Date: Mon, 22 Sep 2025 06:56:56 +0800
Subject: [PATCH] feat: add solutions to lc problem: No.3005

No.3005.Count Elements With Maximum Frequency
---
 .../README.md                                 | 48 +++++++++++++++++++
 .../README_EN.md                              | 48 +++++++++++++++++++
 .../Solution.cs                               | 18 +++++++
 .../Solution.js                               | 20 ++++++++
 4 files changed, 134 insertions(+)
 create mode 100644 solution/3000-3099/3005.Count Elements With Maximum Frequency/Solution.cs
 create mode 100644 solution/3000-3099/3005.Count Elements With Maximum Frequency/Solution.js

diff --git a/solution/3000-3099/3005.Count Elements With Maximum Frequency/README.md b/solution/3000-3099/3005.Count Elements With Maximum Frequency/README.md
index 202562211927e..b98fb2c14b528 100644
--- a/solution/3000-3099/3005.Count Elements With Maximum Frequency/README.md	
+++ b/solution/3000-3099/3005.Count Elements With Maximum Frequency/README.md	
@@ -193,6 +193,54 @@ impl Solution {
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxFrequencyElements = function (nums) {
+    const cnt = new Array(101).fill(0);
+    for (const x of nums) {
+        ++cnt[x];
+    }
+    let [ans, mx] = [0, -1];
+    for (const x of cnt) {
+        if (mx < x) {
+            mx = x;
+            ans = x;
+        } else if (mx === x) {
+            ans += x;
+        }
+    }
+    return ans;
+};
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int MaxFrequencyElements(int[] nums) {
+        int[] cnt = new int[101];
+        foreach (int x in nums) {
+            ++cnt[x];
+        }
+        int ans = 0, mx = -1;
+        foreach (int x in cnt) {
+            if (mx < x) {
+                mx = x;
+                ans = x;
+            } else if (mx == x) {
+                ans += x;
+            }
+        }
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/3000-3099/3005.Count Elements With Maximum Frequency/README_EN.md b/solution/3000-3099/3005.Count Elements With Maximum Frequency/README_EN.md
index ac39e762a25b9..7efd54257a109 100644
--- a/solution/3000-3099/3005.Count Elements With Maximum Frequency/README_EN.md	
+++ b/solution/3000-3099/3005.Count Elements With Maximum Frequency/README_EN.md	
@@ -191,6 +191,54 @@ impl Solution {
 }
 ```
 
+#### JavaScript
+
+```js
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxFrequencyElements = function (nums) {
+    const cnt = new Array(101).fill(0);
+    for (const x of nums) {
+        ++cnt[x];
+    }
+    let [ans, mx] = [0, -1];
+    for (const x of cnt) {
+        if (mx < x) {
+            mx = x;
+            ans = x;
+        } else if (mx === x) {
+            ans += x;
+        }
+    }
+    return ans;
+};
+```
+
+#### C#
+
+```cs
+public class Solution {
+    public int MaxFrequencyElements(int[] nums) {
+        int[] cnt = new int[101];
+        foreach (int x in nums) {
+            ++cnt[x];
+        }
+        int ans = 0, mx = -1;
+        foreach (int x in cnt) {
+            if (mx < x) {
+                mx = x;
+                ans = x;
+            } else if (mx == x) {
+                ans += x;
+            }
+        }
+        return ans;
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/solution/3000-3099/3005.Count Elements With Maximum Frequency/Solution.cs b/solution/3000-3099/3005.Count Elements With Maximum Frequency/Solution.cs
new file mode 100644
index 0000000000000..d4626012af33f
--- /dev/null
+++ b/solution/3000-3099/3005.Count Elements With Maximum Frequency/Solution.cs	
@@ -0,0 +1,18 @@
+public class Solution {
+    public int MaxFrequencyElements(int[] nums) {
+        int[] cnt = new int[101];
+        foreach (int x in nums) {
+            ++cnt[x];
+        }
+        int ans = 0, mx = -1;
+        foreach (int x in cnt) {
+            if (mx < x) {
+                mx = x;
+                ans = x;
+            } else if (mx == x) {
+                ans += x;
+            }
+        }
+        return ans;
+    }
+}
diff --git a/solution/3000-3099/3005.Count Elements With Maximum Frequency/Solution.js b/solution/3000-3099/3005.Count Elements With Maximum Frequency/Solution.js
new file mode 100644
index 0000000000000..459a122a36d3f
--- /dev/null
+++ b/solution/3000-3099/3005.Count Elements With Maximum Frequency/Solution.js	
@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxFrequencyElements = function (nums) {
+    const cnt = new Array(101).fill(0);
+    for (const x of nums) {
+        ++cnt[x];
+    }
+    let [ans, mx] = [0, -1];
+    for (const x of cnt) {
+        if (mx < x) {
+            mx = x;
+            ans = x;
+        } else if (mx === x) {
+            ans += x;
+        }
+    }
+    return ans;
+};