Examples:
Input: ant magenta magnate tan gnamate Output: 3 Explanation Anagram strings (1) - ant, tan Anagram strings (2) - magenta, magnate, gnamate Thus, only second subset have largest size ie, 3 Input: cars bikes arcs steer Output: 2
We have a solution to this problem, please refer to subset-anagram-words /> to link subset-anagram-words/> Find size of largest subset of anagram words ... We can quickly fix this problem in python using the subset of the anagram lines.
# Function for determining the size of the largest subset Number of anagram words from collections import Counter def maxAnagramSize ( input ): # split input string with space input = input .split ( "" ) # sort each line in the given list of lines for i in range ( 0 , len ( input )): input [i] = ’’ .join ( sorted ( input [i])) # now create a dictionary using the counter method # which will have strings as a key and their # frequencies as value freqDict = Counter ( input ) # get maximum frequency print ( max (freqDict.values ())) # Driver program if __ name__ = = "__ main__" : input = ’ant magenta magnate tan gnamate’ maxAnagramSize ( input ) |
Output:
3