Java String Reverse

Sort by

recency

|

1919 Discussions

|

  • + 0 comments

    String res =""; for(int i = A.length()-1;i >=0; i--){ res = res+(A.charAt(i)); } if (res.equals(A)){ 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();
        String rev=null;
        sc.close();
        for(int i=A.length()-1; i>0;i--){
            rev = rev+A.charAt(i);
        }
        if(rev==A){
            System.out.println("yes");
        }
    }
    

    }

  • + 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();
        boolean isPalindrome = true;
        int length = A.length();
        for (int i = 0; i < length / 2; i++) {
            if (A.charAt(i) != A.charAt(length - 1 - i)) {
                isPalindrome = false;
                break;
            }
        }
        System.out.println(isPalindrome ? "Yes" : "No");
        sc.close();
    }
    

    }

  • + 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. */
       // String B = sc.next();
        int left  = 0 , right = A.length() - 1;
        boolean isPalindrome = true;
    
        while(left < right) {
            char l = A.charAt(left) , r = A.charAt(right);
            if(!Character.isLetterOrDigit(l)) {
                left++;
            }else if(! Character.isLetterOrDigit(r)) {
                right -- ;
    
            }if(l != r ){
                isPalindrome = false;
                break;
    
            }else {
                left++;
                right--;
            }
    
        }
        if(isPalindrome){
                System.out.println("Yes");
       }else {
                System.out.println("No");
            }
        sc.close();
    }
    

    }****

  • + 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();
        char[] arr = A.toCharArray();
        boolean flag = true;
    
        /* Enter your code here. Print output to STDOUT. */
        for(int i = 0, j = (A.length()-1); i < A.length(); i++, j--)
        {
            if(arr[i] != arr[j])
            {
                flag = false;
                break;
            }
        }
    
        if(flag == false)
            System.out.println("No");
        else
            System.out.println("Yes");
    }
    

    }