content: 
  // Never seen it before = insert and set to 1 to indiciate we've now seen it
  import java.io.*;
  import java.math.*;
  import java.security.*;
  import java.text.*;
  import java.util.*;
  import java.util.concurrent.*;
  import java.util.regex.*;
  
  public class solution {
  
      // Complete the sherlockAndAnagrams function below.
      static int sherlockAndAnagrams(String s) {
          HashMap<String, Integer> map = new HashMap<String, Integer>();
  
          // total anagrams
          int totalCount = 0;
  
          for (int i = 0; i < s.length(); i++) {
              for (int j = i + 1; j <= s.length(); j++) {
                  String currentSubString = s.substring(i, j);
  
                  // Sort all strings E.g. ab & ba both == ab
                  char[] chars = currentSubString.toCharArray();
                  Arrays.sort(chars);
                  currentSubString = String.valueOf(chars);
  
                  // If sorted substring has been seen before
                  if (map.containsKey(currentSubString)) {
                      // Check how many times we've seen it and add that amount to the count
                      int value = map.get(currentSubString);
                      totalCount = totalCount + value;
  
                      // Increament the times we've seen the string
                      map.put(currentSubString, value + 1);
                  } else {
                      // if we are seeing it for the first time set it's value as 1
                      map.put(currentSubString, 1);
                  }
              }
          }
          return totalCount;
  
      }
  
      private static final Scanner scanner = new Scanner(System.in);
  
      public static void main(String[] args) throws IOException {
          BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
  
          int q = scanner.nextInt();
          scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
  
          for (int qItr = 0; qItr < q; qItr++) {
              String s = scanner.nextLine();
  
              int result = sherlockAndAnagrams(s);
  
              bufferedWriter.write(String.valueOf(result));
              bufferedWriter.newLine();
          }
  
          bufferedWriter.close();
  
          scanner.close();
      }
  }
  