Given two positive integers left and right, find two prime numbers num1 and num2 such that:

• left $\leq num1 < num2 \leq$ right

• Both num1 and num2 are prime numbers

• The difference $num2 - num1$ is the minimum possible among all valid pairs

Return the array $[num1, num2]$. If there are multiple pairs that achieve the same minimum difference, return the pair with the smallest num1. If fewer than $2$ prime numbers exist in the inclusive range $[$left, right$]$, return $[-1, -1]$.

Constraints:

• $1 \leq$ left $\leq$ right $\leq 10^6$

Input: left = 1-int, right = 2-int
Output: [-1,-1]-List[int]
Explanation: There are fewer than two prime numbers in the inclusive range [1, 2], so the result is [-1, -1].

Input: left = 14-int, right = 16-int
Output: [-1,-1]-List[int]
Explanation: There are no prime numbers in the inclusive range [14, 16], so the result is [-1, -1].

Input: left = 20-int, right = 40-int
Output: [29,31]-List[int]
Explanation: The closest prime pair in the inclusive range [20, 40] is 29 and 31, with a difference of 2.

Input: left = 100-int, right = 130-int
Output: [101,103]-List[int]
Explanation: The closest prime pair in the inclusive range [100, 130] is 101 and 103, with a difference of 2.

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.