Leetcode Problem 204. Count Primes

204. Count Primes

Leetcode Solutions

Initialize an array isPrime of length n with True (except for indices 0 and 1 which are False).
Start with the first prime number, p = 2.
Use a nested loop where the outer loop runs from 2 to sqrt(n) and the inner loop marks the multiples of p as False.
In the inner loop, start marking from p*p up to n in increments of p.
After marking the multiples of p, find the next number greater than p that is not marked and set p to this new number.
Repeat steps 3-5 until p exceeds sqrt(n).
Count the number of True values in the isPrime array, which represents the number of primes less than n.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen