We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Sherlock and Anagrams
  5. Discussions

Sherlock and Anagrams

  • coder1033
     + 7 comments

    using collections and itertools in python 3

    from collections import Counter
from itertools import combinations

def sherlockAndAnagrams(s):
count = []
for i in range(1,len(s)+1):
    a = ["".join(sorted(s[j:j+i])) for j in range(len(s)-i+1)]
    b = Counter(a)
    count.append(sum([len(list(combinations(['a']*b[j],2))) for j     in b]))
return sum(count)