isAnagram = (s, t) => {
    const isEqual = s.length === t.length;
    if (!isEqual) return false;

    return reorder(s) === reorder(t); /* Time O(N * logN) | Space O(N) */
}
Sort - HeapSort Space O(1) | QuickSort Space O(log(N))
Time O(N * logN) | Space O(N)
https://leetcode.com/problems/valid-anagram/
@param {string} s
@param {string} t
@return {boolean}