Chef The String Lover
All submissions for this problem are available.
Being an String Lover,Chef loves to solve anagrams and has decided to take part in International anagram solving contest at codechef.com.He wants to devise a method by which he can solve anagrams quickly.
Definition: An anagram of a string is another string that contains same characters, only the order of characters can be different. For example, “abcd” and “dabc” are anagram of each other.
Your task is to help him with the efficient solution
First line contains string x and second line contains string y
if y is an anagram of x,print "Y is Anagram of X" without quotes else print "Not Anagram" without quotes
Note:x and y can contains only lowercase alphabets
Y is Anagram of X
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, SCM qobi, ST, NICE, BASH, NEM, LISP sbcl, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions