Java String Reverse - Hacker Rank Solution
Given a string A, print Yes if it is a palindrome, print No
otherwise.
Constraints
A will consist of
most 50 lower cases English letters.
Sample Input
madam
Sample Output
Yes
Solution:
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
String b = "";
Scanner sc=new Scanner(System.in);
String A=sc.next();
/* Enter your code here. Print output to STDOUT. */
int n = A.length();
for(int i = n - 1; i >= 0; i--)
{
b = b + A.charAt(i);
}
if(A.equalsIgnoreCase(b))
{
System.out.println("Yes");
}
else
{
System.out.println("No");
}
}
}