class Solution {
    public boolean isAnagram(String s, String t) {
        /*String sModified = sortLetters(s);
        String tModified = sortLetters(t);

        return sModified.equals(tModified);*/

        int[] sFreqs = new int[26], tFreqs = new int[26];
        for(char letter : s.toCharArray()) {
            sFreqs[letter - 'a']++;
        }
        for(char letter : t.toCharArray()) {
            tFreqs[letter - 'a']++;
        }

        return Arrays.equals(sFreqs, tFreqs);
    }

    private String sortLetters(String s) {
        char[] letters = s.toCharArray();
        Arrays.sort(letters);
        return new String(letters);
    }
 }