Determine if Two Strings Are Close LeetCode solution in Java

1
class Solution {
2
  private int N = 26;
3

4
  public boolean closeStrings(String word1, String word2) {
5
    // count the English letters
6
    int[] arr1 = new int[N], arr2 = new int[N];
7
    for (char ch : word1.toCharArray()) arr1[ch - 'a']++;
8
    for (char ch : word2.toCharArray()) arr2[ch - 'a']++;
9

10
    // if one has a letter which another one doesn't have, dont exist
11
    for (int i = 0; i < N; i++) {
12
      if (arr1[i] == arr2[i]) {
13
        continue;
14
      }
15
      if (arr1[i] == 0 || arr2[i] == 0) {
16
        return false;
17
      }
18
    }
19
    Arrays.sort(arr1);
20
    Arrays.sort(arr2);
21
    for (int i = 0; i < N; i++) {
22
      if (arr1[i] != arr2[i]) {
23
        return false;
24
      }
25
    }
26
    return true;
27
  }
28
}