# Sherlock and Anagrams

### Problem Statement :

```Two strings are anagrams of each other if the letters of one string can be rearranged to form the other string. Given a string, find the number of pairs of substrings of the string that are anagrams of each other.

For example s = mom , the list of all anagrammatic pairs is [m,m], [mo, om] at positions [ [1], [2], [0,1], [1,2] ] respectively .

Function Description

Complete the function sherlockAndAnagrams in the editor below. It must return an integer that represents the number of anagrammatic pairs of substrings in s.

sherlockAndAnagrams has the following parameter(s)
s: a string .

Input Format

The first line contains an integer q , the number of queries .
Each of the next  q lines contains a string s to analyze.

Constraints

1 <= q <= 10
2 <= | s| <= 100

Output Format

For each query, return the number of unordered anagrammatic pairs.```

### Solution :

```                            ```Solution in C :

In C :

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

typedef struct node{
int s;
int e;
}node;

void combine(node *A,int start,int end,int index,int *sum,node *temp,char *str){

if(index == 2){
int m[26] = {0};
int i;
for(i=temp[0].s;i<=temp[0].e;i++)
m[str[i] - 'a']++;

for(i=temp[1].s;i<=temp[1].e;i++)
m[str[i] - 'a']--;

for(i=0;i<26;i++)
if(m[i])
return;

*sum += 1;
return;
}

int i;

for(i=start;i<end;i++){
temp[index] = A[i];
combine(A,i+1,end,index+1,sum,temp,str);
}

}

int main() {

/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int t;
scanf("%d",&t);

while(t--){
char *str = (char*)malloc(sizeof(char)*101);
scanf("%s",str);

node *A = (node*)malloc(sizeof(node)*100);

int index = 0;

int i;
int len = strlen(str);

int count;
int sum = 0;

while(index<len){
count = 0;
for(i=0;i<len;i++){
A[i].s = i;
if(i+index>=len)
break;
A[i].e = i+index;
count++;
}

if(count>=2){
node *temp = (node*)malloc(sizeof(node)*2);
combine(A,0,count,0,&sum,temp,str);
}
index++;
}

printf("%d\n",sum);

}
return 0;
}```
```

```                        ```Solution in C++ :

In C ++ :

#include<bits/stdc++.h>
#include <cstdio>
#define MAX 5000
using namespace std;
map<string,int> mp ;
int main(){
ios::sync_with_stdio(0);
int t;
cin>>t;
while(t--){
mp.clear();
string s,sn,ss ;
int j;
cin>>s;
int l=s.length();
for(int k=0;k<l;k++){
ss = "";
for(int i=0;i<l-k;i++){
j = k+i;
ss = ss + s[j];
sn = ss ;
sort(sn.begin() , sn.end());
mp[sn]++;
}
}
long long int ans = 0 ;
map<string,int> :: iterator it ;
for(it = mp.begin() ; it != mp.end() ; it++){
long long  vl = (long long)(it->second) ;
if(vl > 1){
ans += (vl*(vl-1))/2LL ;
}
}
cout<<ans<<endl;
}
return 0;
}```
```

```                        ```Solution in Java :

In Java :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

private static int count[][] = new int[128][110];

private static void resetCount() {
for (int i = 0; i < count.length; i++) for (int j = 0; j < count[i].length; j++) count[i][j] = 0;
}

private static boolean areAnagrams(int from1, int to1, int from2, int to2) {
for (int i = 'a'; i <= 'z'; i++) {
if (count[i][to1+1]-count[i][from1] != count[i][to2+1]-count[i][from2])
return false;
}
return true;
}

public static void main(String[] args) {
final Scanner sc = new Scanner(System.in);
final int TC = Integer.parseInt(sc.nextLine());
for (int tc = 0; tc < TC; tc++) {
final char s[] = sc.nextLine().toCharArray();
resetCount();
count[s[0]][1] = 1;
for (int i = 1; i < s.length; i++) {
for (int j = 'a'; j <= 'z'; j++) count[j][i+1] = count[j][i];
count[s[i]][i+1]++;
}
int res = 0;
for (int len = 1; len <= s.length-1; len++) {
for (int from = 0; from <= s.length-len; from++) {
for (int to = from+1; to <= s.length-len; to++) {
if (areAnagrams(from, from+len-1, to, to+len-1)) res++;
}
}
}
System.out.println(res);
}
}
}```
```

```                        ```Solution in Python :

In Python3 :

for _ in range(int(input())):
was = dict()
s = input()

n = len(s)
for i in range(n):
for j in range(i, n):
cur = s[i:j + 1]
cur = ''.join(sorted(cur))
was[cur] = was.get(cur, 0) + 1

ans = 0
for x in was:
v = was[x]
ans += (v * (v - 1)) // 2

print(ans)```
```

## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .