Valid Anagram
EASYHash MapsGiven 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.
Examples
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 * 10^4
- s and t consist of lowercase English letters.
Select Mode
Solo Practice
Solve on your own with test feedback. Ask Sophia for hints when stuck.
Coach Me (Sophia)
Sophia guides you through the problem step-by-step.
Mock Interview with Sophia
Simulate a real interview with Sophia as your interviewer.