Leetcode Problem 866. Prime Palindrome
Leetcode Solutions
Iterate Palindromes
- If
nis less than or equal to 2, return 2 as it is the smallest prime number. - If
nis 11 or less, check the numbers 3, 5, 7, and 11 and return the smallest prime palindrome greater than or equal ton. - For other values of
n, find the palindromic root by taking the first half of the digits ofn. - Generate the next palindrome by incrementing the palindromic root and mirroring it to form the full palindrome.
- Check if the generated palindrome is prime. If it is, return it.
- If not, repeat steps 4 and 5 until a prime palindrome is found.
Brute Force with Mathematical Shortcut
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...