@@ -0,0 +1,798 @@
+package javaStringReverse;%0A%0Aimport java.util.Scanner;%0A%0Apublic class Solution %7B%0A    %0A%09public static boolean isPalindrom(String palindrom) %7B%0A%09%09if( palindrom.length() == 1 %7C%7C palindrom.length() == 0 ) return true;%0A%09%09if( palindrom.charAt(0) == palindrom.charAt(palindrom.length() - 1) && palindrom.length() %3E 2) %0A%09%09%09return true && isPalindrom(palindrom.substring(1, palindrom.length() - 1));%0A%09%09if( palindrom.charAt(0) == palindrom.charAt(palindrom.length() - 1) ) return true;%0A%09%09return false;%0A%09%7D%0A%09%0A%09public static void main(String%5B%5D args) %7B%0A        %0A        Scanner scanner =new Scanner(System.in);%0A        String palindrom = scanner.next();%0A        if(isPalindrom(palindrom))%0A        %09System.out.println(%22Yes%22);%0A        else%0A        %09System.out.println(%22No%22);%0A        %0A        scanner.close();%0A    %7D%0A%7D%0A

Add solution for problem Java String Reverse