242. Valid Anagram

• Difficulty: Easy

• Topics: Hash Table, Sort

• Similar Questions:

  • Group Anagrams

  • Palindrome Permutation

  • Find All Anagrams in a String

Problem:

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?

Solutions:

class Solution {
public:
    bool isAnagram(string s, string t) {
        if (s.length() != t.length())   return false;
        int count[26] = {0};
        for (auto c : s) {
            ++count[c - 'a'];
        }

        for (auto c : t) {
            if (--count[c - 'a'] < 0) return false; 
        }

        return true;
    }
};