Count Primes - Practice Coding | SlaveCode
Problems
Scratchpad
Run
Submit
0
0
1
2
3
4
5
6
7
8
9
0
0
1
2
3
4
5
6
7
8
9
:
0
0
1
2
3
4
5
6
7
8
9
0
0
1
2
3
4
5
6
7
8
9
Toggle theme (Current: Custom)
Scratchpad
Run
Submit
Description
Hints
Solutions
204. Count Primes
Medium
30 Points
Array
Math
Enumeration
Number Theory
Given an integer n, return the number of prime numbers that are strictly less than n.
Examples
Example 1
Input: n = 10 Output: 4 Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
Example 2
Input: n = 0 Output: 0
Example 3
Input: n = 1 Output: 0
Constraints
0 <= n <= 5 * 106
JAVASCRIPT
Code
Tests
Result
Description
Hints
Solutions
204. Count Primes
Medium
30 Points
Array
Math
Enumeration
Number Theory
Given an integer n, return the number of prime numbers that are strictly less than n.
Examples
Example 1
Input: n = 10 Output: 4 Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
Example 2
Input: n = 0 Output: 0
Example 3
Input: n = 1 Output: 0
Constraints
0 <= n <= 5 * 106
JAVASCRIPT
Code
Tests
Result