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

  • cherkashin_i_a
     + 0 comments

    python (NOTE replace '@' with ':' - HackerRank didn't allow to upload this comment when having ':' in the text).

    import itertools
def sherlockAndAnagrams(s):
    return sum([
    len([
        pair
        for pair in itertools.combinations([s[i@i+l] for i in range(len(s) - l + 1)], 2)
        if sorted(pair[0]) == sorted(pair[1])
    ])
    for l in range(1, len(s))
    ])