Sieve of Eratosthenes | Count Primes | Leetcode 204

Time: O(n*log(log n)); https://www.geeksforgeeks.org/how-is-the-time-complexity-of-sieve-of-eratosthenes-is-nloglogn/
Spane: O(n)

Topic: Array

Code:
https://github.com/Nideesh1/Algo/blob/master/leetcode/L_204.java

Leetcode:
https://leetcode.com/problems/count-primes/

*Note* I claim no rights to this question. All rights belong to Leetcode. If I'm reviewing a solution that was from another Leetcode user or Leetcode itself I will give credit below.

Credit to :

Intro:(0:00)
Input/Output/Approach:(0:11)
Sieve:(0:33)
Sieve Reasoning:(0:57)
Code:(3:18)
Dry Run:(4:08)

Видео Sieve of Eratosthenes | Count Primes | Leetcode 204 канала Nideesh Terapalli