Logo
IconChallenge
Icon
IconProblem
IconSolutions
IconSubmissions

Valid Anagram

XPChallenge Points: 10
levelLevel: Easy

You are given two strings, s and t.
Your task is to determine whether t is an anagram of s.

An anagram is a word or phrase formed by rearranging the letters of another word, using all original characters exactly once.

Return true if t is an anagram of s, otherwise return false.

Example 1:

Input: s = "listen", t = "silent"

Output: true

Example 2:

Input: s = "hello", t = "world"

Output: false

to Continue
like
dislike

Accepted:

Submission:

IconReport an issue
Icon
IconCode
IconYou need toto run or submitYou need toto run or submit
IconTest Case
IconTest Result