What the post says
#1001daysofcode 's #day174" "Just did a question with Sieve of Eratosthenes as I was doing some prime and recursion stuff." "" "Leetcode:" "204. Count Primes" "" "The time complexity of the sieve is O(nlog(logn))." "It is the best and easiest way to count or find the count of the primes in a given range." "However, it has a slightly worse running form that is euler's sieve." "It works on the principle of marking the composite number." "I connect it to hashing and pre-computation stuff." "" "#1001daysofcode #dsa #python #java #coding #geeksforgeeks #notion #programming #daily #cpp #learning
Follow the challenge
Browse the Days of Code journal for selected updates. Shivam's projects show where regular practice connects to shipped software.