Back to Questions

Count Primes

130.2K views•Asked at Amazon•
Medium

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

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views