1
// Prime Palindrome
2
// Leetcode problem: https://leetcode.com/problems/prime-palindrome/
3

4
class Solution {
5
  public int primePalindrome(int n) {
6
    while (true) {
7
      if (isPrime(n) && isPalindrome(n)) {
8
        return n;
9
      }
10
      n++;
11
    }
12
  }
13

14
  private boolean isPrime(int n) {
15
    if (n == 1) {
16
      return false;
17
    }
18
    for (int i = 2; i <= Math.sqrt(n); i++) {
19
      if (n % i == 0) {
20
        return false;
21
      }
22
    }
23
    return true;
24
  }
25

26
  private boolean isPalindrome(int n) {
27
    String s = String.valueOf(n);
28
    int i = 0;
29
    int j = s.length() - 1;
30
    while (i < j) {
31
      if (s.charAt(i) != s.charAt(j)) {
32
        return false;
33
      }
34
      i++;
35
      j--;
36
    }
37
    return true;
38
  }
39
}