# Meta Strings

Posted: 10 Jan, 2021
Difficulty: Easy

## PROBLEM STATEMENT

#### Meta strings are strings that can be made equal by swapping exactly one pair of distinct characters in one of the strings.

##### Note:
``````Equal strings are not considered as meta strings.
``````
##### Input Format:
``````The first line of input contains an integer 'T' denoting the number of test cases or queries to be run.

The first line of each test case or query contains the first string “STR1”.

The second line of the test case or query contains the second string “STR2”.
``````
##### Output Format:
``````For each test case, print a single line containing “YES” if the strings are meta strings otherwise, “NO”.

The output of each test case will be printed in a separate line.
``````

#### Note:

``````You do not need to print anything; it has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 10
2 <= length of STR1<= 10 ^ 5
2 <= length of STR2 <= 10 ^ 5
`````` Approach 1
1. Check if the two strings are of equal length or not. If not, then it is impossible to make them equal.
2. Now, the idea is to count the number of unmatched characters in the strings.
3. If the count of unmatched characters is not equal to 2, then it is impossible to make the strings equal. As we have to swap exactly one pair of characters.
4. If the count is 2, find their indices and swap the character at these indices.
5. After swapping the characters check if the characters at unmatched indices became equal or not.