HACKER RANK: Sherlock and Anagrams

Problem Link: https://www.hackerrank.com/challenges/sherlock-and-anagrams

Given a string S, find the number of "unordered anagrammatic pairs" of substrings.

Input Format

First line contains T, the number of testcases. Each testcase consists of string S in one line.

Constraints 
1≤T≤10 
2≤length(S)≤100 
String S contains only the lowercase letters of the English alphabet.

Output Format

For each testcase, print the required answer in one line.

Logic:

Let's say S[i,j] denotes the substring Si,Si+1,⋯,Sj.

Match Subset Si  With Si+1, ....... Sj For anagram.

To View My Solution:

https://github.com/shivam04/hackerrank/blob/master/sherlock-and-anagrams.java