Leetcode 2523. Closest Prime Numbers in Range

Find the two prime numbers within [left, right] whose difference is minimal (break ties by the smaller first number), returning [-1, -1] if fewer than two primes exist. Constraint left, right ≤ 10^6 means you must efficiently enumerate/check primes and scan adjacent primes to find the closest pair.