Update appNew update is available. Click here to update.

Ninja's Gift

Posted: 26 Mar, 2021
Difficulty: Hard

PROBLEM STATEMENT

Try Problem

Ninja is going to visit her friend Mico. He is thinking to gift her a string. But he came to know that Mico only likes the string 'S'. Ninja already has a string 'K'. Now, Ninja can change the string 'K' in some other string by choosing any character in one move and change all its occurrence with any other lowercase English character. He can do this several times.

Help Ninja to find if he can change his string 'K' to string 'S', which Mico likes.

Note:
Both 'S' and 'K' contain only lowercase English characters.
For Example:
K = "aabb" and S = "bbcc"
Now Ninja can do the following changes:
- Change ‘b’ to ‘c’ -> “aacc”
- Change ‘a’ to ‘b’ -> “bbcc”

Hence Ninja can give Mico the desired gift.
Input Format
The first line of input contains an integer ‘T’ denoting the number of test cases to run. Then the test case follows.

The first line of each test case contains a string 'S'.

The next line of each test case contains a string 'K'.
Output Format
For each test case, if Ninja can convert K into S, return “True” else return “False”.
Note:
You don’t need to take any input or print anything. This already has been taken care of. Just implement the function.
Constraints:
1 <= T <= 5
1 <= |K|, |S| <= 10^5

Time Limit: 1 second