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.
![](https://static.ambitionbox.com/static/knowledge-ai.png)
AnswerBot
1y
The question is not understandable or relevant to SAP MM Consultant role.
The question seems to be gibberish and not related to the job role.
I would request the interviewer to clarify or rephrase the q...read more
![](https://static.ambitionbox.com/alpha/community/assets/no-posts.png)
Help your peers!
Add answer anonymously...
Top Digital Web Analytics and Optimization Software Developer interview questions & answers
Popular interview questions of Software Developer
>
Digital Web Analytics and Optimization Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
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
Get AmbitionBox app