Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Is Anagram

Limits 1s, 512 MB

An anagram is a word formed by rearranging the letters of another word.

The words "listen" and "silent" has the same letters in them appearing the same number of times. This makes these two words anagram to each other.

Given two words, you need to determine if they are anagrams of each other.

Input

The input will contain two strings AA and BB (0<Length of A and B<1000 < \texttt{Length of A and B} < 100), one per line.

AA and BB will contain lowercase alphabets only.

Output

Print Yes\texttt{Yes} if the two words are anagrams of each other, otherwise No\texttt{No}.

Sample

InputOutput
listen
silent
Yes

Discussion

Statistics


93% Solution Ratio

hasanakhiarEarliest, Nov '18

hasanakhiarFastest, 0.0s

CCS_RUSHIKONLightest, 0 B

saitotaShortest, 45B

Submit

Login to submit

Toph uses cookies. By continuing you agree to our Cookie Policy.