Java String Reverse

Sort by

recency

|

1886 Discussions

|

  • + 0 comments

    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.equals(new StringBuffer(A).reverse().toString())){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }
    
    }
    

    }

  • + 0 comments

    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. */
        int strLength = A.length();
        String reverseStr="";
    
    for (int i = (strLength - 1); i >=0; --i) {
        reverseStr = reverseStr + A.charAt(i);
    }
    
    if (A.toLowerCase().equals(reverseStr.toLowerCase())) {
      System.out.println( "Yes");
    }
    else {
      System.out.println( "No");
    }     
    }
    

    }

  • + 0 comments

    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. */
    
        boolean isPolindrome = true;
        for(int i = 0 ; i < A.length() ; i++){
            if(A.charAt(i) != A.charAt(A.length() - 1 - i)){
                isPolindrome = false;
                break;
            }
        }
    
        if(isPolindrome){
            System.out.println("Yes");
        }else{
            System.out.println("No");  
        }
    
    }
    

    }

  • + 0 comments

    The solution is targeting to create a reverced string to compare the original across.

    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();
            String B = "";
            
            for (int i = A.length() - 1; i >= 0; i--) {
                B = B + A.charAt(i);
            }
            
            if (A.compareTo(B) == 0) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
            
            
        }
    }
    
  • + 0 comments

    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. */
        A = A.toLowerCase();
        char[] initial;
        char[] finalstring = new char[A.length()];
        initial = A.toCharArray();
    
        for (int i = A.length()-1; i >= 0; i--) {
            finalstring[i] = initial[A.length()-1-i];
        }
    
        String one = String.valueOf(initial);
        String two = String.valueOf(finalstring);
        // System.out.println(one);
        if (one.equals(two))
        {
            System.out.println("Yes");
        }
        else
        {
            System.out.println("No");
        }
    
    
    }
    

    }