Search
⌘K

Leetcode 3591. Check if Any Element Has Prime Frequency

Count element frequencies in the array and return true if any frequency is a prime number (>1). This reduces to frequency counting (map/array) and checking each count for primality (nums.length ≤ 100).


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.