You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.
Hackerrank Java String Reverse Solution

Hackerrank Java String Reverse Solution

Beeze Aal
Beeze Aal
A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward or forward.(Wikipedia)

Given a string , print Yes if it is a palindrome, print No otherwise.

Constraints

  • will consist at most  lower case english letters.

Sample Input

madam

Sample Output

Yes

Solution in java8

Approach 1.

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        
        Scanner sc=new Scanner(System.in);
        String A=sc.next();
        
        
        if(A.equalsIgnoreCase(new StringBuffer(A).reverse().toString()))
            System.out.println("Yes");
        else
            System.out.println("No");
        
    }
}

Approach 2.

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        
        Scanner sc=new Scanner(System.in);
        String A=sc.next();
        /* Enter your code here. Print output to STDOUT. */
        String rev = "";
        for(int i=A.length()-1;i>=0;i--)
            rev+=A.charAt(i);
        if(rev.equals(A))
            System.out.println("Yes");
        else
                    System.out.println("No");

    }
}