add 3591

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -76,6 +76,7 @@
 | 3622 | [Check Divisibility by Digit Sum and Product](https://leetcode.com/problems/check-divisibility-by-digit-sum-and-product/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3622.java) |                                                                               | Easy       | 
 | 3608 | [Minimum Time for K Connected Components](https://leetcode.com/problems/minimum-time-for-k-connected-components/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3608.java) |                                                                               | Medium     | UnionFind
 | 3606 | [Coupon Code Validator](https://leetcode.com/problems/coupon-code-validator/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3606.java) |                                                                               | Easy       |
+| 3591 | [Check if Any Element Has Prime Frequency](https://leetcode.com/problems/check-if-any-element-has-prime-frequency/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3591.java) |                                                                               | Easy       |
 | 3582 | [Generate Tag for Video Caption](https://leetcode.com/problems/generate-tag-for-video-caption/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3582.java) |                                                                               | Easy       |
 | 3581 | [Count Odd Letters from Number](https://leetcode.com/problems/count-odd-letters-from-number/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3581.java) |                                                                               | Easy       |
 | 3571 | [Find the Shortest Superstring II](https://leetcode.com/problems/find-the-shortest-superstring-ii/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3571.java) |                                                                               | Easy       |

src/main/java/com/fishercoder/solutions/fourththousand/_3591.java

@@ -0,0 +1,40 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+
+public class _3591 {
+    public static class Solution1 {
+        public boolean checkPrimeFrequency(int[] nums) {
+            Map<Integer, Integer> map = new HashMap<>();
+            for (int num : nums) {
+                map.put(num, map.getOrDefault(num, 0) + 1);
+            }
+            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
+                if (isPrime(entry.getValue())) {
+                    return true;
+                }
+            }
+            return false;
+        }
+
+        private boolean isPrime(Integer n) {
+            if (n <= 2) {
+                return false;
+            }
+            boolean[] isPrime = new boolean[n + 1];
+            Arrays.fill(isPrime, true);
+            isPrime[0] = false;
+            isPrime[1] = false;
+            for (int i = 2; i < n; i++) {
+                if (isPrime[i]) {
+                    for (int j = 2; i * j <= n; j++) {
+                        isPrime[i * j] = false;
+                    }
+                }
+            }
+            return isPrime[n];
+        }
+    }
+}