Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6454 |

@blackshadows | 6380 |

@mb1973 | 5714 |

@Quandray | 5245 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5046 |

@sanjay05 | 3762 |

@kirtidee18 | 3709 |

@mantu_singh | 3556 |

@marius_valentin_dragoi | 3523 |

@sushant_a | 3459 |

Complete Leaderboard | |

Handle | Score |

@cfwong8 | 1285 |

@gurshehzadsingh | 1052 |

@pritsahkar2000 | 812 |

@satyamchhatrala | 804 |

@nithinreddy3210 | 801 |

@iib2019024 | 745 |

@mohanreddy8847 | 704 |

@iamchaitanyahegde | 662 |

@shafeeq3543 | 647 |

@workit | 646 |

@AkashLahoty | 642 |

Complete Leaderboard |

For a given number **N** check if it is prime or not. A prime number is a number which is only** divisible by 1 and itself**.

**Example 1:**

**Input:**
N = 5
**Output:**
1
**Explanation:**
5 has 2 factors 1 and 5 only.

**Example 2:**

**Input:**
N = 25
**Output:**
0
**Explanation:**
25 has 3 factors 1, 5, 25

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **isPrime()** which takes an integer **N** as input parameters and returns an integer, 1 if N is a prime number or 0 otherwise.

**Expected Time Complexity:** O(sqrt(N))

**Expected Space Complexity:** O(1)

**Constraints:**

1 <= N <= 10^{9}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Prime Number

...