Given an integer n, return the number of prime numbers that are strictly less than n.
Example 1:
Input: n = 10 Output: 4 Explanation: There are 4 primes less than 10: 2, 3, 5, 7.
Example 2:
Input: n = 0 Output: 0
Constraints: 0 <= n <= 5 * 10^6
math
number theory
amazon
google
linkedin
Run to check your code against the sample cases, or submit to run every case