Back to Question
Count Primes
Question Explain
Given an integer $n$, return the number of prime numbers that are strictly less than $n$. Use the Sieve of Eratosthenes algorithm.
Start Trying This Question Simulation
Click "Start Speaking" and answer the question naturally.