Prime Number Detection | Dataford Interview Questions

Find the prime numbers in code.

Implement def find_primes(n): to return a list of every prime number from 2 through n, inclusive. Return an empty list when n < 2. Aim for an efficient solution suitable for values of n up to 1,000,000.

Constraints

0 <= n <= 1,000,000
Return primes in ascending order
The upper bound n is inclusive

Function Signature

def find_primes(n):

Your question is Prime Number Detection. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Find the prime numbers in code.

Constraints

0 <= n <= 1,000,000
Return primes in ascending order
The upper bound n is inclusive

Function Signature

def find_primes(n):

Your question is Prime Number Detection. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.