Leetcode 204. Count Primes

Count how many prime numbers are strictly less than a given integer n. The challenge is to generate primes efficiently (e.g., Sieve of Eratosthenes) to handle n up to about 5×10^6 within O(n log log n) time and O(n) space.