Prime Checking Algorithm | Dataford Interview Questions

Write an algorithm to determine if a number is prime.

Implement is_prime(n), which accepts an integer and returns True if it has exactly two positive divisors, and False otherwise. Return False for values less than 2. Use a function-based solution with no input parsing or output formatting.

Constraints

-10^9 <= n <= 10^9
n is an integer
Return a boolean value

Function Signature

def is_prime(n):

Your question is Prime Checking Algorithm. 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 an algorithm to determine if a number is prime.

Constraints

-10^9 <= n <= 10^9
n is an integer
Return a boolean value

Function Signature

def is_prime(n):

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