Valid Anagram

easy

1. You are given two Strings S and T of lowercase letters only.
 2. You have to find whether T is an anagram of S or not.
 3. main takes input Strings S and T from the users.
 4. This is a functional problem. 
 5. You have to complete the isAnagram function. It takes as input the String S and String T. It should return true if T is and anagram of S, else should return false.
 6. Don't change the code of main.

Input Format

First line takes input S. Second line takes input T. Input is handled for you.

Output Format

Yes, if T is anagram of S else No Output is handled for you.

Constraints

N/A

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

pepcoding 
dongpcpie

Output

Yes

Isomorphic Strings

Longest Subarray With Sum Divisible By K

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String medium Smallest Substring Of A String Containing All Unique Characters Of Itself