You are given an integer array nums.

Return the maximum distance between the indices of any two prime numbers in nums.

Constraints:

• $1 \leq$ nums.length $\leq 3 imes 10^5$

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

• The input is generated such that nums contains at least $1$ prime number.

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.