<awangdev>[HackerRank]. Change to Anagram_1.java
public int validate(String str) {

        if (str.length() % 2 == 1) {
            return -1;
        } 
        String sA = str.substring(0, str.length()/2);
        String sB = str.substring(str.length()/2);
        
        int[] arr = new int[26];
        for (int i = 0; i < sA.length(); i++) {
            char cA = sA.charAt(i);
            char cB = sB.charAt(i);
            if (cA < 'a' || cA > 'z' || cB < 'a' || cB > 'z') {
                return -1;
            } 
            arr[cA - 'a']++;
            arr[cB - 'a']--;
        }
        
        int count = 0;
        for (int num : arr) {
            count += Math.abs(num);
        }
        return count/2;
    }
public int sample_funcname ( String var_1 ) {
  if ( var_1 . length ( ) % 2 == 1 ) {
    return - 1 ;
  }
  String var_7 = var_1 . substring ( 0 , var_1 . length ( ) / 2 ) ;
  String var_8 = var_1 . substring ( var_1 . length ( ) / 2 ) ;
  int [ ] var_10 = new int [ 26 ] ;
  for ( int var_11 = 0 ;
  var_11 < var_7 . length ( ) ;
  var_11 ++ ) {
    char var_13 = var_7 . charAt ( var_11 ) ;
    char var_14 = var_8 . charAt ( var_11 ) ;
    if ( var_13 < 'a' || var_13 > 'z' || var_14 < 'a' || var_14 > 'z' ) {
      return - 1 ;
    }
    var_10 [ var_13 - 'a' ] ++ ;
    var_10 [ var_14 - 'a' ] -- ;
  }
  int var_17 = 0 ;
  for ( int var_18 : var_10 ) {
    var_17 += Math . abs ( var_18 ) ;
  }
  return var_17 / 2 ;
}
