Jul 13, 2025 · 5 min read · Problem Description LeetCode 204 Count Primes Given an integer n, return the number of prime numbers that are less than n. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. For example, if n = ...
Join discussion
Oct 6, 2023 · 3 min read · What are Prime Numbers? In simpler terms, they are numbers that can only be divided by 1 and the number itself. Introducing the Sieve Algorithm The Sieve Algorithm is a brilliant and efficient way to find all prime numbers up to a given limit. How do...
Join discussion
Feb 12, 2023 · 6 min read · Hello, Sieve of Eratosthenes I hope you all know what Seive is. This article will give you different variations of sieves. So, for those who don't know what "Sieve of Eratosthenes" is, it is just a faster way to calculate all the prime numbers betwee...
Join discussion
Dec 12, 2022 · 3 min read · In the previous article, we learned about what is sieve of Eratosthenes algorithm and how to implement it in java. in this article, we are going to learn about the time and space complexity of sieve of the Eratosthenes algorithm. Let us take an examp...
Join discussion
Dec 11, 2022 · 3 min read · first, we are going to understand the conceptual part of this algorithm after that we will be looking for the coding region of the sieve of Eratosthenes, ok. great, first of all, we should have the question why use this algorithm? here is the answer,...
Join discussionOct 7, 2022 · 3 min read · সিভ নিয়ে ফয়সালের এই লেখা পড়লে,কন্সেপ্ট বুঝতে সুবিধা হবে । কোনো সংখ্যাকে ১ এবং ঐ সংখ্যা ছাড়া আর কোনো সংখ্যা দ্বারা ভাগ করা না গেলে , সংখ্যাটা প্রাইম নাম্বার, আর যদি ভাগ যায় তাহলে সেটা কম্পজিট নাম্বার. একটা নাম্বার প্রাইম কিনা সেটা জানার জন্য প্রচলিত এ...
Join discussion
Jun 13, 2022 · 4 min read · ECX 30 Days of Code and Design Day 23 Sieve of Eratosthenes Task The sieve of Eratosthenes is an ancient algorithm for finding all primes less than a given value N. It operates as follows: Create a list of consecutive integers from 2 through n: (2, ...
Join discussion