UVA - 1339 - Ancient Cipher (Java Solution)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringBuffer sb = new StringBuffer("");
        String m="";
        while((m=br.readLine())!=null){
            String x=m;
            String y=br.readLine();
            if(distBetWords(x, y)){
                sb.append("YES\n");
            }else{
                sb.append("NO\n");
            }
        }
        System.out.print(sb);
    }
   
    static boolean distBetWords(String x,String y){
        int sum1=0,sum2=0;
        int[]arr1=new int[26],arr2=new int[26];
        for (int i = 0; i < x.length(); i++) {
            arr1[x.charAt(i)-65]++;
            arr2[y.charAt(i)-65]++;
        }
        Arrays.sort(arr1);
        Arrays.sort(arr2);
        StringBuilder sb=new StringBuilder();
        StringBuilder sb2=new StringBuilder();
        for (int i = 0; i < 26; i++) {
           sb.append(arr1[i]);
           sb2.append(arr2[i]);
        }
        if(sb.toString().equals(sb2.toString())){
            return true;
        }
        return false;
    }
}