Easy
Valid Anagram
Easy
0 submissions
10 coins
+50 XP
Hash Table
Sorting
String
Problem Description
Given two strings `s` and `t`, return `true` if `t` is an **anagram** of `s`, and `false` otherwise.
An **anagram** is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
**Example 1:**
```
Input: s = "anagram", t = "nagaram"
Output: True
```
**Example 2:**
```
Input: s = "rat", t = "car"
Output: False
```
**Example 3:**
```
Input: s = "a", t = "a"
Output: True
```
Constraints
- `1 <= s.length, t.length <= 5 * 10^4`
- `s` and `t` consist of lowercase English letters.
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share