 # Meta Strings (Check if two strings can become same after a swap in one string)

Given two strings, the task is to check whether these strings are meta strings or not. Meta strings are the strings which can be made equal by exactly one swap in any of the strings. Equal string are not considered here as Meta strings.

Examples:

```Input : str1 = "geeks"
str2 = "keegs"
Output : Yes
By just swapping 'k' and 'g' in any of string,
both will become same.

Input : str1 = "rsting"
str2 = "string
Output : No

Input :  str1 = "Converse"
str2 = "Conserve"
```

Below are steps used in the algorithm.

1. Check if both strings are of equal length or not, if not return false.
2. Otherwise, start comparing both strings and count number of unmatched characters and also store the index of unmatched characters.
3. If unmatched characters are more than 2 then return false.
4. Otherwise check if on swapping any of these two characters in any string would make the string equal or not.
5. If yes then return true. Otherwise return false.
 `// C++ program to check if two strings are meta strings ``#include ``using` `namespace` `std; `` ` `// Returns true if str1 and str2 are meta strings ``bool` `areMetaStrings(string str1, string str2) ``{ ``    ``int` `len1 = str1.length(); ``    ``int` `len2 = str2.length(); `` ` `    ``// Return false if both are not of equal length ``    ``if` `(len1 != len2) ``        ``return` `false``; `` ` `    ``// To store indexes of previously mismatched ``    ``// characters ``    ``int` `prev = -1, curr = -1; `` ` `    ``int` `count = 0; ``    ``for` `(``int` `i=0; i 2) ``                ``return` `false``; `` ` `            ``// Store both unmatched characters of ``            ``// both strings ``            ``prev = curr; ``            ``curr = i; ``        ``} ``    ``} `` ` `    ``// Check if previous unmatched of string1 ``    ``// is equal to curr unmatched of string2 ``    ``// and also check for curr unmatched character, ``    ``// if both are same, then return true ``    ``return` `(count == 2 && ``            ``str1[prev] == str2[curr] && ``            ``str1[curr] == str2[prev]); ``} `` ` `// Driver code ``int` `main() ``{ ``    ``string str1 = ``"converse"``; ``    ``string str2 = ``"conserve"``; `` ` `    ``areMetaStrings(str1,str2) ? cout << ``"Yes"``                            ``: cout << ``"No"``; ``    ``return` `0; ``} `

Output:
`Yes` #### More Articles of M Mounika:

Name Views Likes
C++ Segmented Sieve (Print Primes In a Range) 162 0
C++ Sieve Of Erastosthenes 136 0
C++ Gold Mine Problem 295 0
C++ Merge K Sorted Arrays 117 0
C++ K Centers Problem 240 0
C++ Find Nth Catalan Number 311 0
C++ Inplace Rotate square matrix by 90 degrees 286 0
C++ Find Non Repeating Elements in Array 87 0
C++ Merge Two Binary Trees 121 0
C++ Sum of Numbers From Root To Leaf Paths 89 0
C++ Meta Strings 92 0
C++ Flood Fill Algorithm 402 0
C++ smallest substring with maximum distinct characters 200 0
C++ Smallest window with all characters in string 94 0
C++ Minimum Removal of Characters from string to make its permutation as palindrome 87 0
C++ Minimum characters added at front of string in palindrome conversion 70 0
C++ Number of Bracket Reversals needed to make expression Balanced 72 0
C++ String to Palindrome with Append Function 83 0
C++ WildCard pattern matching 76 0
C++ Anagram substring Search 72 0
C++ Manachars Algorithm 74 0
C++ Search String in Grid 83 0
C++ String Matching(Z Algorithm) 67 0
C++ String Matching(Naive Algorithm) 114 0
C++ String Matching(KMP Algorithm) 141 0
C++ Remove Duplicates From String 111 0
C++ Basics of String Manipulation 85 1
C++ Disjoint Data Structure Cycle Detection 87 0
C++ Problem On Disjoint Data Structures 95 0
C++ Disjoint Data Structures Part3 79 0
Disjoint Data Structures Part2 90 0
Disjoint Data Structures 93 1
C++ Segment Trees 321 2
C++ Trie Cost of Data 291 1
C++ Trie Datastructure 279 1
C++ Greedy Approach Minimum number of coins 526 0
C++ Greedy Approach Maximum height Pyramid 329 1
C++ Greedy Approach String lexicographically largest subsequence 247 0
C++ Greedy Approach Lexicographically largest subsequence 364 0
C++ Greedy Approach Prims MST 398 1
C++ Greedy Approach Krushkals MST 458 1
C++ Greedy Approach N-array maximum sum 334 1
C++ Greedy Approach Policemen Catch Thieves 563 1
C++ Greedy Approach Maximum product Subset 546 1
C++ Greedy Approach Minimum Product Subset 349 1
C++ Greedy Approach Fractional Knapsack 737 1
C++ Greedy Approach-Activity Selection Problem 745 1
C++ Greedy Approach-Egyptian Fractions 640 0
C++ Greedy Approach-Huffman Codes 1031 1
C++ Introduction to Greedy Approach 955 2