How should I practice Find All Primes Less Than N?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Microsoft onsite interview problems in FastPrep.

Is Find All Primes Less Than N associated with Microsoft?

FastPrep tags this as a Microsoft onsite interview coding practice problem when the problem catalog has that company and stage context.

Find All Primes Less Than N

Microsoft● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

Given a nonnegative integer n, return every prime number strictly less than n in increasing order.

Function

primesLessThan(n: int) → int[]

Examples

Example 1

n = 10return = [2,3,5,7]

The primes smaller than 10 are 2, 3, 5, and 7.

Example 2

n = 2return = []

There is no prime strictly smaller than 2.

Constraints

0 <= n <= 5000000