@Test public void testIsPalindromeString() { assertTrue(Library.isPalindrome("")); assertTrue(Library.isPalindrome("a")); assertTrue(Library.isPalindrome("aa")); assertTrue(Library.isPalindrome("aaa")); assertTrue(Library.isPalindrome("aaaa")); assertTrue(Library.isPalindrome("aba")); assertTrue(Library.isPalindrome("abba")); assertTrue(Library.isPalindrome("abbba")); assertTrue(Library.isPalindrome("acbca")); assertFalse(Library.isPalindrome("ab")); assertFalse(Library.isPalindrome("ba")); assertFalse(Library.isPalindrome("aaba")); assertFalse(Library.isPalindrome("abcd")); }
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);  }