Given an integer array nums, determine whether there exists at least one element whose frequency of occurrence in nums is a prime number.

Return true if at least one such element exists, and false otherwise.

Note: A prime number is an integer strictly greater than $1$ that has no positive divisors other than $1$ and itself.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $0 \leq$ nums[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.