String Transformation

Problem Statement

String Transformation Problem Description You are given two strings S and T of the same length. You need to determine if it's possible to transform string S into T with the following rule any number of times: You can map a character from string S to a character of String T and replace all the occurrences of that character in string S. Notes: All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map to itself. Note: Your code must be able to print the sample output from the provided sample input. However, your code is run against multiple hidden test cases. Therefore, your code must pass these hidden test cases to solve the problem statement. Limits: Time Limit: 1.0 sec(s) for each input file Memory Limit: 256 MB Source Limit: 1024 KB Input Format The first line of input contains an integer N, the number of test cases. For every test case: The first line contai