> For the complete documentation index, see [llms.txt](https://maksimdan.gitbook.io/interview-practice-problems/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/242_valid_anagram.md).

# 242 Valid Anagram

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.

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