242. Valid Anagram
Question
Given two strings s and t , return true if t is an anagram of s , and false otherwise.
Example 1:
Input: s = "anagram", t = "nagaram"
Output: true
Example 2:
Input: s = "rat", t = "car"
Output: false
Constraints:
1 <= s.length, t.length <= 5 * 10 4sandtconsist of lowercase English letters.
Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?
Solutions
bool isAnagram(string s, string t) {
if (s.size() != t.size()) return false;
vector<int> words(26, 0);
for (char c : s) {
words[c - 'a'] += 1;
}
for (char c : t) {
words[c - 'a'] -= 1;
if (words[c - 'a' != 0]) return false;
}
return true;
}