Array and Prime Number Coding | Dataford Interview Questions

Given a number, how would you check if it was prime with code?

Implement is_prime(n) to return True if n is prime and False otherwise. Handle numbers less than 2 and optimize the check so divisors are tested only through the square root of n.

Input is one integer n; output is a Boolean.

Constraints

-10^12 <= n <= 10^12
The input is an integer
Return a Boolean value

Function Signature

def is_prime(n):

Your question is Array and Prime Number Coding. 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