Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4610 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 603 |

@akashverma4 | 363 |

@swastik8750 | 300 |

@nishunishuraj18 | 286 |

@surajmamgai | 264 |

@anks9013 | 222 |

@nayan2709 | 213 |

@burhanuddinbohra72 | 212 |

@realname | 203 |

@amank8975 | 203 |

@manmeetkaur18102000 | 202 |

Complete Leaderboard |

A prime number is a **Circular Prime Number **if all of its possible rotations are itself prime numbers. Now given a number N check if it is Circular Prime or Not.

**Example 1:**

Input:N = 197Output:1Explanation:197 is a Circular Prime because all rotations of 197 are 197, 719, 971 all of the 3 are prime number's hence 197 is a circular prime.

**Example 2:**

Input:N = 101Output:0Explanation:101 and 11 is prime but 110 is not a prime number.

**Your Task:**

You don't need to read or print anything. Your task is to complete the function **isCircularPrime()** which takes N as input parameter and returns 1 if it is Circular Prime otherwise returns -1.

**Expected Time Complexity: **O(Nlog(log(N))

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

**Constraints:**

1 <= N <= 10^{5}

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?

Yes
Circular Prime Number

...