Preparing this workspace.
Valid Anagram
Difficulty: Easy
Category: DSA
Topics: Hash Table, String, Sorting
Asked at: Bloomberg, Facebook, Microsoft, Amazon, Apple, Oracle, Google, Goldman Sachs, Adobe, Cisco, Paypal, Qualcomm
Given two strings `s` and `t`, return `true` if `t` is an anagram of `s`, and `false` otherwise.
**Example 1:**
**Input:** s = "anagram", t = "nagaram"
**Output:** true
**Example 2:**
**Input:** s = "rat", t = "car"
**Output:** false
**Constraints:**
- `1 <= s.length, t.length <= 5 * 104`
- `s` and `t` consist of lowercase English letters.
**Follow up:** What if the inputs contain Unicode characters? How would you adapt your solution to such a case?
Opening the problem
Progress is saved as you study.