Don’t worry if it doesn’t work right. If everything did, you’d be out of a job. Mosher’s Law
String Anagram
Interview Problem
Check whether two given strings are an anagram of each other or not.
Write a program to check anagram for given two strings. An anagram of a string is another string that contains same characters, only the order of characters can be different
Example:-
"silent" which can be rearranged to "listen". The two can be used in the phrase, "Think about it, SILENT and LISTEN are spelled with the same letters"
Output
Check anagram for 'silent' and 'listen' :true Check anagram for 'test1' and 'test2' :false
Comments