Only those who are able to solve , only they will solve , plzzz.... . Solve it in python . Arnab is a robber and he has managed to rob N different strings from Akash. Now he decides to sell these strings in the market to make some profit. But, of all the strings he has, he wants to find the size of the largest anagram group so that he can easily sell that one first and make maximum profit initially. Help him find the largest size of groups of anagrams. 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. Input: First line of input contains an integer N, number of total strings. Next N lines contains a single string S. Output: Print the largest size of group of anagrams possible. Constraints: N SAMPLE INPUT 5 ab ba cab bca cba SAMPLE OUTPUT 3 Explanation Groups of anagrams that can be formed are : {ab,ba} {cab, bca, cba} So the answer is 3 as largest size of group of anagram is 3.
Answers
Explanation:
onlyonly those who are able to solve only they will plus solve the preposition of the Robert and has managed and different string of code eas now I decided to sell the bring market onto the sum of the profit but of the strings he has the want to find the two of the largest ashram group so that can be easily to fast and maximum and above a gram of the string in the other and contents of character only the other tracks at by using the easy and then a maximum can be awakened by the two of the sentences in the following of the Nations in the two of the nation's by which the characters are only characters are ABCD and a b d c a b d and the agaram of the input and first in the contents of the UN and the total of the and in the group of The impossible constraints and in the sample for example group of the three the longer side of the group is 3 the nap36 answer is 6 the print out the largest know the answer will be a b c d and e COD plus