Fetching algorithms...

Sieve of Eratosthenes Visualizer & Solution | Rulcode

54. Sieve of Eratosthenes

Medium

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: n = 10

Output: [2, 3, 5, 7]

Explanation: The prime numbers less than or equal to 10 are 2, 3, 5, and 7.

Example 2:

Input: n = 20

Output: [2, 3, 5, 7, 11, 13, 17, 19]

Explanation: The prime numbers less than or equal to 20 are 2, 3, 5, 7, 11, 13, 17, and 19.

Example 3:

Input: n = 2

Output: [2]

Explanation: The only prime number less than or equal to 2 is 2.

Example 4:

Input: n = 1

Output: []

Explanation: There are no prime numbers less than or equal to 1.

Constraints:

Time Complexity

O(n log log n)

Space Complexity

O(n)

Loading problem details...

rulcode

54. Sieve of Eratosthenes

Medium

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: n = 10

Output: [2, 3, 5, 7]

Explanation: The prime numbers less than or equal to 10 are 2, 3, 5, and 7.

Example 2:

Input: n = 20

Output: [2, 3, 5, 7, 11, 13, 17, 19]

Explanation: The prime numbers less than or equal to 20 are 2, 3, 5, 7, 11, 13, 17, and 19.

Example 3:

Input: n = 2

Output: [2]

Explanation: The only prime number less than or equal to 2 is 2.

Example 4:

Input: n = 1

Output: []

Explanation: There are no prime numbers less than or equal to 1.

Constraints:

Time Complexity

O(n log log n)

Space Complexity

O(n)

54. Sieve of Eratosthenes

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Example 4:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

54. Sieve of Eratosthenes

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Example 4:

Constraints:

Learn

Topics

Companies

Hint

Use Cases