@Test public void testIsPalindromeInt() { assertTrue(Library.isPalindrome(0)); assertTrue(Library.isPalindrome(1)); assertTrue(Library.isPalindrome(5)); assertTrue(Library.isPalindrome(11)); assertTrue(Library.isPalindrome(33)); assertTrue(Library.isPalindrome(101)); assertTrue(Library.isPalindrome(151)); assertTrue(Library.isPalindrome(737)); assertTrue(Library.isPalindrome(2222)); assertTrue(Library.isPalindrome(5665)); assertTrue(Library.isPalindrome(2147447412)); assertFalse(Library.isPalindrome(12)); assertFalse(Library.isPalindrome(43)); assertFalse(Library.isPalindrome(220)); assertFalse(Library.isPalindrome(1010)); assertFalse(Library.isPalindrome(2147483647)); }
public static boolean isPalindrome(String s) { return s.equals(reverse(s)); }
Library { public static boolean isPalindrome(String s) { return s.equals(reverse(s)); } }
Library { public static boolean isPalindrome(String s) { return s.equals(reverse(s)); }  }
Library { public static boolean isPalindrome(String s) { return s.equals(reverse(s)); }  static String reverse(String s); static boolean isPalindrome(String s); static boolean isPalindrome(int x); static int sqrt(int x); static long sqrt(long x); static BigInteger sqrt(BigInteger x); static boolean isSquare(int x); static int pow(int x, int y); static int powMod(int x, int y, int m); static int reciprocalMod(int x, int m); static BigInteger factorial(int n); static BigInteger binomial(int n, int k); static int gcd(int x, int y); static boolean isPrime(int x); static boolean[] listPrimality(int n); static int[] listPrimes(int n); static int[] listSmallestPrimeFactors(int n); static int totient(int n); static int[] listTotients(int n); static boolean nextPermutation(int[] arr); }
Library { public static boolean isPalindrome(String s) { return s.equals(reverse(s)); }  static String reverse(String s); static boolean isPalindrome(String s); static boolean isPalindrome(int x); static int sqrt(int x); static long sqrt(long x); static BigInteger sqrt(BigInteger x); static boolean isSquare(int x); static int pow(int x, int y); static int powMod(int x, int y, int m); static int reciprocalMod(int x, int m); static BigInteger factorial(int n); static BigInteger binomial(int n, int k); static int gcd(int x, int y); static boolean isPrime(int x); static boolean[] listPrimality(int n); static int[] listPrimes(int n); static int[] listSmallestPrimeFactors(int n); static int totient(int n); static int[] listTotients(int n); static boolean nextPermutation(int[] arr);  }