Check Permutation Problem Statement

Given two strings 'STR1' and 'STR2', determine if they are anagrams of each other.

Explanation:

Two strings are considered to be anagrams if they contain the same characters, regardless of the order.

Input:

The first line contains an integer 'T' denoting the number of test cases.
The first and only line of each test case contains two space-separated strings 'STR1' and 'STR2'.

Output:

For each test case, return true if the two strings are anagrams, otherwise return false.
Output each result on a new line.

Example:

Input:
T = 1
STR1 = "listen" STR2 = "silent"
Output:
true

Constraints:

• 1 <= T <= 100
• 1 <= |STR1|, |STR2| <= 10³

Where |STR1| and |STR2| are the lengths of the strings 'STR1' and 'STR2' respectively.

Time limit: 1 sec