text: /*
   * @lc app=leetcode id=242 lang=javascript
   *
   * [242] Valid Anagram
   *
   * https://leetcode.com/problems/valid-anagram/description/
   *
   * algorithms
   * Easy (53.83%)
   * Total Accepted:    416K
   * Total Submissions: 770.6K
   * Testcase Example:  '"anagram"\n"nagaram"'
   *
   * Given two strings s and t , write a function to determine if t is an anagram
   * of s.
   *
   * Example 1:
   *
   *
   * Input: s = "anagram", t = "nagaram"
   * Output: true
   *
   *
   * Example 2:
   *
   *
   * Input: s = "rat", t = "car"
   * Output: false
   *
   *
   * Note:
   * You may assume the string contains only lowercase alphabets.
   *
   * Follow up:
   * What if the inputs contain unicode characters? How would you adapt your
   * solution to such case?
   *
   */
  /**
   * @param {string} s
   * @param {string} t
   * @return {boolean}
   */
  const isAnagram = function (s, t) {
    return s.split('').sort().join('') === t.split('').sort().join('')
  }
  