You are given an integer array nums and an integer k.

A subarray of nums is called prime gap balanced if:

• It contains at least $2$ prime numbers.

• The difference between the maximum prime number and the minimum prime number in the subarray is at most k.

Return the total number of prime gap balanced subarrays in nums.

Note: A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

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

• $1 \leq$ nums[i] $\leq 5 imes 10^4$

• $0 \leq$ k $\leq 5 imes 10^4$

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.