Valid Anagram — C# Coding Problem
Difficulty: easy | Category: 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 formed by rearranging the letters of another, using all original letters exactly once. **Constraints:** - `1 <= s.length, t.length <= 5 × 10⁴` - `s` and `t` consist of lowercase English letters.
Examples
Example 1
Input: s = "anagram", t = "nagaram"
Output: true
Example 2
Input: s = "rat", t = "car"
Output: false