Prime Numbers Identification

Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

Explanation:

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. Example: 2, 3, 17, etc.

Input:

N = 10

Output:

2 3 5 7

Example:

Input:
N = 20
Output:
2 3 5 7 11 13 17 19

Constraints:

  • 2 <= N <= 10^7
  • The solution should work within a 1-second time limit.

Note:

You are not required to print anything; it has already been taken care of. You need to implement the logic to determine the prime numbers.

AnswerBot
4d

Identify all prime numbers less than or equal to a given positive integer N.

  • Iterate from 2 to N and check if each number is prime

  • Use the Sieve of Eratosthenes algorithm for better efficiency

  • Optimize b...read more

Help your peers!
Add answer anonymously...
Yodlee Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter