Verify Prime

Given a number N, verify if N is prime or not.

Return 1 if N is prime, else return 0.

Example :

Input : 7
Output : True

Problem Approach:

Complete code in the hint.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Verify Prime on Interview Code Editor
Sign Up
to access hints and editorial solutions for Verify Prime

Discussion


Loading...
Click here to start solving coding interview questions