Split input string separated by space into words. As we know two strings are anagram to each other if they contain same character set. So to get all those strings together first we will sort each string in given list of strings. Now create a dictionary using Counter method having strings as keys and their frequencies as value. Check for maximum value of frequencies, that will be the largest sub-set of anagram strings.