'triangle' and 'integral' 'listen' and 'silent'
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct.
The first and the only line of input contains two single space-separated strings Str1 and Str2, respectively.
Neither of the two input strings contains spaces in between, except to differentiate one from the other. Also, both the strings will be in lowercase characters.
The only line of output contains either True or False. True, if the given two strings form an anagram pair and False otherwise. You don't have to explicitly print by yourself. It has already been taken care of.
1 <= N <= 10^5 1 <= M <= 10^5 Where N and M are the lengths of the strings str1 and str2 , respectively. Time Limit: 1sec
Anagrams have a unique property: the counts of each distinct character present in both strings are the same. One way to check this is:
Ninja and Numbers
Longest Palindromic Substring