Optimized Prime Checking | Dataford Interview Questions

Write a most optimized code to find if a number is prime or not.

Implement is_prime(n) to return a Boolean. The input is one integer, and the function must return True only for prime numbers. Use an algorithm that avoids testing every integer up to n; for example, is_prime(29) returns True, while is_prime(1) returns False.

Constraints

n is an integer
0 <= n <= 10^12
Return a Boolean value

Function Signature

def is_prime(n):

Your question is Optimized Prime Checking. 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

Write a most optimized code to find if a number is prime or not.

Constraints

n is an integer
0 <= n <= 10^12
Return a Boolean value

Function Signature

def is_prime(n):

Your question is Optimized Prime Checking. 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.