input: Write a python function to identify all anagrams of substrings within a given string.
  assert get_anagrams("abc") == []
  assert get_anagrams("aabb") == ['aab', 'abb', 'aab', 'abb']
  assert get_anagrams("abac") == ['aac', 'abc', 'abc']
output: def get_anagrams(s):
      from collections import Counter
      def is_anagram(str1, str2):
          return Counter(str1) == Counter(str2)
      
      result = []
      length = len(s)
      
      for size in range(2, length + 1):
          for i in range(length - size + 1):
              for j in range(i + 1, length - size + 2):
                  if is_anagram(s[i:i + size], s[j:j + size]):
                      result.append(s[i:i + size])
                      result.append(s[j:j + size])
      return result