D. J.:

- Added the leetcode problem and solution for 2523

Author: nobodyPerfecZ

README.md

@@ -262,6 +262,7 @@
 - [1964 Find the Longest Valid Obstacle Course at Each Position](https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position/description/)
 - [2140 Solving Questions With Brainpower](https://leetcode.com/problems/solving-questions-with-brainpower/description/)
 - [2466 Count Ways To Build Good Strings](https://leetcode.com/problems/count-ways-to-build-good-strings/description/)
+- [2523 Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range/description/)
 - [2799 Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/description/)
 - [3392 Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/description/)
 

awesome_python_leetcode/_2523_closest_prime_numbers_in_range.py

@@ -0,0 +1,32 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def getPrimes(self, left: int, right: int) -> List[int]:
+        primes = [True for i in range(right + 1)]
+        primes[0] = primes[1] = False
+        p = 2
+        while p * p < right + 1:
+            if primes[p]:
+                for i in range(p * p, right + 1, p):
+                    primes[i] = False
+            p += 1
+        return [i for i in range(left, right + 1) if primes[i]]
+
+    def closestPrimes(self, left: int, right: int) -> List[int]:
+        primes = self.getPrimes(left, right)
+
+        if len(primes) < 2:
+            return [-1, -1]
+        if len(primes) == 2:
+            return primes
+
+        prime1 = primes[0]
+        prime2 = primes[1]
+        for i in range(0, len(primes) - 1):
+            if primes[i + 1] - primes[i] < prime2 - prime1:
+                prime1 = primes[i]
+                prime2 = primes[i + 1]
+        return [prime1, prime2]

tests/test_2523_closest_prime_numbers_in_range.py

@@ -0,0 +1,19 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._2523_closest_prime_numbers_in_range import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["left", "right", "expected"],
+    argvalues=[
+        (10, 19, [11, 13]),
+        (4, 6, [-1, -1]),
+        (19, 31, [29, 31]),
+    ],
+)
+def test_func(left: int, right: int, expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    closest_primes = Solution().closestPrimes(left, right)
+    assert closest_primes == expected