You have been given two strings 'S' and ‘T’. Your task is to find if ‘S’ follows the same pattern as ‘T’.
Here follow means a full match, i.e. there is a bijection between a letter of ‘T’ and a non-empty word of ‘S’.
If the given string is S = "lion cow cow lion" and T = “wccw”, then the string ‘S’ follows the same pattern as string ‘T’.
'T’ contains only lowercase English letters.
‘S’ contains only lowercase English letters and spaces.
‘S’ does not contain any trailing or leading spaces. All words in ‘S’ are separated by a single space.
The first line contains an integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
The first line of each test case contains a string ‘S’.
The second line of each test case contains a string ‘T’.
For each test case, the only line of output will print “Yes” if ‘S’ follows the same pattern as ‘T’. Else print “No”.
Print the output of each test case in a separate line.
You are not required to print the expected output, it has already been taken care of. Just implement the function.
1 <= t <= 100
1 <= |S| <= 5000
1 <= |T| <= 5000
Time Limit: 1 second
Sample Input 1:
ship ship ship ship
Sample Output 1:
Explanation For Sample Output 1:
Here, string ‘S’ does not match the pattern with the string ‘T’ because different characters map the same word.
Sample Input 2:
red blue blue red
moon moon moon moon
Sample Output 2: