26 lines
342 B
Markdown
26 lines
342 B
Markdown
|
## Valid Anagram
|
||
|
|
|
||
|
|
Given two strings s and t , write a function to determine if t is an anagram of s.
|
||
|
|
|
||
|
|
### Examples
|
||
|
|
|
||
|
|
**Example 1**
|
||
|
|
|
||
|
|
```text
|
||
|
|
Input: s = "anagram", t = "nagaram"
|
||
|
|
Output: true
|
||
|
|
```
|
||
|
|
|
||
|
|
**Example 2**
|
||
|
|
|
||
|
|
```text
|
||
|
|
Input: s = "rat", t = "car"
|
||
|
|
Output: false
|
||
|
|
```
|
||
|
|
|
||
|
|
---
|
||
|
|
|
||
|
|
### Notes
|
||
|
|
|
||
|
|
- You may assume the string contains only lowercase alphabets.
|