2523 Closest Prime Numbers in Range

2523 Closest Prime Numbers in Range. This Java code finds the pair of prime numbers within a given range [left, right] that have the smallest difference between them. summary: 1. First, it generates all prime numbers up to 'right' using the Sieve of Eratosthenes algorithm 2. Then it collects all primes within the range [left, right] 3. If there are fewer than 2 primes in the range, it returns [-1, -1] 4. Otherwise, it iterates through the collected primes to find the pair with the minimum gap 5. When it finds a pair with a smaller gap, it updates the answer array The time complexity is O(n log log n) where n is the value of 'right', which is efficient for the given constraints (up to 10^6). The space complexity is O(n) to store the sieve array.