1
class Solution {
2
  public boolean isAnagram(String s, String t) {
3
    if (s.length() != t.length()) return false;
4
    int[] haha1 = new int[26]; // 26 because input contains of only lower english letters
5
    int[] haha2 = new int[26];
6
    for (int i = 0; i < s.length(); ++i) {
7
      haha1[(int) s.charAt(i) - 97] += 1; // omitting 97 because 'a' is 97, it will be 0 now
8
      haha2[(int) t.charAt(i) - 97] += 1;
9
    }
10
    for (int i = 0; i < haha1.length; ++i) {
11
      if (haha1[i] != haha2[i]) return false;
12
    }
13
    return true;
14
  }
15
}