Two Strings

Given two strings of equal length, you have to tell whether they both strings are identical.
Two strings S1 and S2 are said to be identical, if any of the permutation of string S1 is equal to the string S2. See Sample explanation for more details.
Input :

• First line, contains an intger 'T' denoting no. of test cases.
• Each test consists of a single line, containing two space separated strings S1 and S2 of equal length.

Output:

• For each test case, if any of the permutation of string S1 is equal to the string S2 print YES else print NO.

Constraints:

• 1<= T <=100
• 1<= |S1| = |S2| <= 10^5
• String is made up of lower case letters only.

Note : Use Hashing Concept Only . Try to do it in O(string length) .

SAMPLE INPUT

3
sumit mitsu
ambuj jumba
abhi hibb

SAMPLE OUTPUT

YES
YES
NO

Explanation

For first test case,
mitsu can be rearranged to form sumit .
For second test case,
jumba can be rearranged to form ambuj .
For third test case,
hibb can not be arranged to form abhi.

Solution-

import java.util.*;

class Two{

static boolean arePermutation(String str1, String str2)

{

    

    int n1 = str1.length();

    int n2 = str2.length();

    if (n1 != n2)

    return false;

    char ch1[] = str1.toCharArray();

    char ch2[] = str2.toCharArray();

    

    Arrays.sort(ch1);

    Arrays.sort(ch2);

    

    for (int i = 0; i < n1; i++)

    if (ch1[i] != ch2[i])

        return false;

    return true;

}

public static void main(String[] args)

{

    Scanner sc=new Scanner(System.in);

    int n=sc.nextInt();

    for(int i=0;i<n;i++)

    {

        String str1 = sc.next();

    String str2 = sc.next();

    if (arePermutation(str1, str2))

    System.out.println("YES");

    else

    System.out.println("NO");

    }

    

}

}