Find prime number between 1 to n
AnswerBot
26d
Use Sieve of Eratosthenes algorithm to find prime numbers between 1 to n.
Implement Sieve of Eratosthenes algorithm
Iterate through numbers from 2 to n
Mark multiples of each number as non-prime
Remaining...read more
Help your peers!
Add answer anonymously...
Top Edunext Technologies Java Developer interview questions & answers
Popular interview questions of Java Developer
Top HR questions asked in Edunext Technologies Java Developer
>
Edunext Technologies Java 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