Strings and 2D Arrays:Check Permutation

public class solution{
public static boolean isPermutation(String input1, String input2){
int frequencyArr[]=new int[256];
  int count=0;
for(int i=0;i<input1.length();i++){
int cha=input1.charAt(i);
    frequencyArr[cha]=frequencyArr[cha]+1;}
    for(int i=0;i<input2.length();i++)
    {
        int ch=input2.charAt(i);
        frequencyArr[ch]=frequencyArr[ch]-1;
 }
    for(int i=0;i<256;i++)
    {
        if(frequencyArr[i]==0)
            count++;
    }
    if(count==256)
        return true;
    else
        return false;
}
}
        
        
        
        
//or
import java.util.*;
public class solution {

    public static boolean isPermutation(String input1, String input2) {
        // Write your code here
        int m=input1.length();
        int n=input2.length();
        if(m!=n)
            return false;
        char ch1[]=input1.toCharArray();
        char ch2[]=input2.toCharArray();
        Arrays.sort(ch1);  
        Arrays.sort(ch2);
        for(int i=0;i<n;i++)
        {
            if(ch1[i]!=ch2[i])
                return false;
        }
        return true;
    }
}