Skip to main content

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 or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Problems11 / 152
Sign in

Valid Anagram

EASYStringHash Table

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 = "anagram", t = "nagaram"
Output: true

Example 2

Input:  s = "rat", t = "car"
Output: false
Show hint

Count the frequency of each character in both strings. They should be equal for anagrams. Or sort both strings and compare.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
s =
"anagram"
t =
"nagaram"
Expected
true
Run with your own input (JSON)