easyHash Map / Set Pattern

Valid Anagram

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 a different word, using all the original letters exactly once.

Examples

Input:s = "anagram", t = "nagaram"
Output:true
Input:s = "rat", t = "car"
Output:false

Hints (0/2)

Try to solve it first! Click "Reveal Next Hint" if you get stuck.

Your Code:
Results:
Output

Click "Run" to execute your code