Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@avaiesshaik782 | 786 |

@arpitsatnalika | 777 |

@tujhekya | 602 |

@prakharxyz | 601 |

@code_it_ | 591 |

@iamronak | 505 |

@imnm | 500 |

@pradeepkumarjad | 488 |

@satyam0460 | 481 |

@nitesha125 | 468 |

@Rahul Jadhav 1 | 466 |

Complete Leaderboard |

Given a number **N**, calculate the prime numbers up to N using Sieve of Eratosthenes.

**Example 1:**

Input:N = 10Output:2 3 5 7Explanation:Prime numbers less than equal to N are 2 3 5 and 7.

**Example 2:**

Input:N = 35Output:2 3 5 7 11 13 17 19 23 29 31Explanation:Prime numbers less than equal to 35 are 2 3 5 7 11 13 17 19 23 29 and 31.

**Your Task: **

You don't need to read input or print anything. Your task is to complete the function **sieveOfEratosthenes****()** which takes an integer N as an input parameter and return the list of prime numbers less than equal to N.

**Expected Time Complexity:** O(NloglogN)

**Expected Auxiliary Space:** O(N)

**Constraints:**

1<= N <= 10^{4}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Sieve of Eratosthenes

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.