Given an integer n, return the count of prime numbers that are strictly less than n.

Constraints:

• $0 \leq$ n $\leq 5 \times 10^6$

The optimal approach to count all prime numbers strictly less than n uses the Sieve of Eratosthenes, a classic number theory algorithm. The core idea is to initialize every number from $0$ to $$ ...