← Microsoft questions

Find prime numbers using Sieve of Eratosthenes

Filed under Microsoft

Given an integer n, return all prime numbers up to n (inclusive) using the Sieve of Eratosthenes algorithm.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.