## Problem Statement

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 = "listen", t = "silent"
Output: true
``` 

**Example 2**:  
```
Input: s = "rat", t = "car"
Output: false
```

**Example 3**:  
```
Input: s = "hello", t = "world"
Output: false
```
**Constraints:**

- 1 <= s.length, t.length <= 5 * 10<sup>4</sup>
- `s` and `t` consist of lowercase English letters.

## Try it yourself
Try solving this question here:

## Problem Statement

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 = "listen", t = "silent"
Output: true
``` 

**Example 2**:  
```
Input: s = "rat", t = "car"
Output: false
```

**Example 3**:  
```
Input: s = "hello", t = "world"
Output: false
```

## Try it yourself
Try solving this question here:

## Problem Statement

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 = "listen", t = "silent"
Output: true
``` 

**Example 2**:  
```
Input: s = "rat", t = "car"
Output: false
```

**Example 3**:  
```
Input: s = "hello", t = "world"
Output: false
```
**Constraints:**

- `1 <= s.length, t.length <= 5 * 104`
- `s` and `t` consist of lowercase English letters.

## Try it yourself
Try solving this question here: