Prime Number Coding | Dataford Interview Questions

Write coding to find a prime number.

Implement is_prime(n) to return True if the given integer is prime and False otherwise. A prime number is an integer greater than 1 with exactly two positive divisors.

The function accepts one integer and returns a Boolean value. Handle values less than 2 correctly and avoid unnecessary divisor checks.

Constraints

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

Function Signature

def is_prime(n):

Your question is 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