Good practice for string handling, character frequency counting, and learning Java basics. cricbet99.club win

import java.util.Scanner;

public class Solution {

static boolean isAnagram(String a, String b) {

if(a.length()!=b.length()){ return false; }

a=a.toLowerCase(); b=b.toLowerCase(); char[] arrA=a.toCharArray(); char[] arrB=b.toCharArray();

java.util.Arrays.sort(arrA); java.util.Arrays.sort(arrB);

return java.util.Arrays.equals(arrA,arrB); } public static void main(String[] args) {

    Scanner scan = new Scanner(System.in);
    String a = scan.next();
    String b = scan.next();
    scan.close();
    boolean ret = isAnagram(a, b);
    System.out.println( (ret) ? "Anagrams" : "Not Anagrams

if (a.length() != b.length()){ return false; } a = a.toLowerCase(); b = b.toLowerCase();

    char[] arrA = a.toCharArray();
    char[] arrB = b.toCharArray();

    java.util.Arrays.sort(arrA);
    java.util.Arrays.sort(arrB);

    return java.util.Arrays.equals(arrA, arrB);
}

import java.util.Scanner;

public class Solution {

static boolean isAnagram(String a, String b) {
   if(a.length()!=b.length()){
    return false;
   }

   a=a.toLowerCase();
   b=b.toLowerCase();

   char[] arrA=a.toCharArray();
   char[] arrB=b.toCharArray();

   java.util.Arrays.sort(arrA);
   java.util.Arrays.sort(arrB);

   return java.util.Arrays.equals(arrA,arrB);
}

public static void main(String[] args) {

    Scanner scan = new Scanner(System.in);
    String a = scan.next();
    String b = scan.next();
    scan.close();
    boolean ret = isAnagram(a, b);
    System.out.println( (ret) ? "Anagrams" : "Not Anagrams" );
}

}

Very Simple and Easy logic

static boolean isAnagram(String a, String b) { if(a.length()!=b.length()) { return false; }

    int [] check = new int[26];
    for(int i =0;i<a.length();i++)
    {
        check[a.toLowerCase().charAt(i)-'a']++;
        check[b.toLowerCase().charAt(i)-'a']--;
    }
    for(int i = 0;i<26;i++)
    {
        if(check[i]!=0){
            return false;
        }
    }
    return true;
  }