Sieve of Eratosthenes

Category: Math & Number Theory

Difficulty: intermediate

Description: Generate all primes up to n

Time Complexity: O(n log log n)

Space Complexity: O(n)

Related LeetCode Problems

• 204. Count Primes (Easy)
• 1750. Minimum Length of String After Deleting Similar Ends (auxiliary) (Medium)
• 2068. Check Whether Two Strings are Almost Equivalent (auxiliary) (Easy)
• 902. Numbers At Most N Given Digit Set (related counting) (Hard)
• 326. Power of Three (Easy)
• 263. Ugly Number (factors practice) (Easy)
• 1223. Dice Roll Simulation (related counting practice) (Medium)