LeetCode 242 Valid Anagram

Valid Anagram

Total Accepted: 75696 Total
Submissions: 181857 Difficulty: Easy

Given two strings s and t, write a function to determine if t is an anagram of s.
For example,

s = "anagram", t = "nagaram", return true.

s = "rat", t = "car", return 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?

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Discuss

#include<iostream>
#include<string>
#include <algorithm>
class Solution {
public:

bool isAnagram(string s, string t) {
sort(s.begin(),s.end());
sort(t.begin(),t.end());
return s==t;
}
};