Marks :10
: 1 | : 0
Two strings are considered anagrams, if the letters of each string can be rearranged to make the two strings equal.
Given two strings $$$s$$$ and $$$t$$$, find whether they are anagrams or not.
The first line of input consists of a string $$$s$$$ $$$(1 \leq |s| \leq 10^6)$$$ consisting of all lowercase English alphabet characters. The second line of input consists of a string $$$t$$$ $$$(1 \leq |t| \leq 10^6)$$$ consisting of all lowercase English alphabet characters.
Output a single word - "YES" if the two strings are anagrams, otherwise "NO".
abcd dcba
YES
You need to login to view your submissions.
You need to login to view all submissions.
Result : Executed
Feel something is wrong with the test cases?
Result : Accepted
Test Cases :
But to Run or Submit the Problem, you need to Log In.
Continue to Log InYour challenge has been submitted successfully.
You will get a response soon via WhatsApp or Email.
Do let us know your issue.