Transform One String to Another using Minimum Number of Given Operation - GeeksforGeeks
Given two strings A and B, the task is to convert A to B if possible. The only operation allowed is to put any character from A and insert it at front. Find if it's possible to convert the string. If yes, then output minimum no. of operations required for transformation.
Checking whether a string can be transformed to another is simple. We need to check whether both strings have same number of characters and same set of characters. This can be easily done by creating a count array for first string and checking if second string has same count of every character.
How to find minimum number of operations when we are sure that we can transform A to B? The idea is to start matching from last characters of both strings. If last characters match, then our task reduces to n-1 characters. If last characters don’t match, then find the position of B’s mismatching character in A. The difference between two positions indicates that these many characters of A must be moved before current character of A.
……a) If current characters of A and B match, i.e., A[i] == B[j]
………then do i = i-1 and j = j-1
……b) If current characters don’t match, then search B[j] in remaining
………A. While searching, keep incrementing result as these characters
………must be moved ahead for A to B transformation.
Read full article from Transform One String to Another using Minimum Number of Given Operation - GeeksforGeeks
Given two strings A and B, the task is to convert A to B if possible. The only operation allowed is to put any character from A and insert it at front. Find if it's possible to convert the string. If yes, then output minimum no. of operations required for transformation.
Checking whether a string can be transformed to another is simple. We need to check whether both strings have same number of characters and same set of characters. This can be easily done by creating a count array for first string and checking if second string has same count of every character.
How to find minimum number of operations when we are sure that we can transform A to B? The idea is to start matching from last characters of both strings. If last characters match, then our task reduces to n-1 characters. If last characters don’t match, then find the position of B’s mismatching character in A. The difference between two positions indicates that these many characters of A must be moved before current character of A.
Time Complexity: O(n), please note that i is always decremented (in while loop and in if), and the for loop starts from n-1 and runs while i >= 0.
2) Start traversing from end of both strings.……a) If current characters of A and B match, i.e., A[i] == B[j]
………then do i = i-1 and j = j-1
……b) If current characters don’t match, then search B[j] in remaining
………A. While searching, keep incrementing result as these characters
………must be moved ahead for A to B transformation.
// Function to find minimum number of operations required to transform// A to B.int minOps(string& A, string& B){ int m = A.length(), n = B.length(); // This parts checks whether conversion is // possible or not if (n != m) return -1; int count[256]; memset(count, 0, sizeof(count)); for (int i=0; i<n; i++) // count characters in A count[B[i]]++; for (int i=0; i<n; i++) // subtract count for count[A[i]]--; // every character in B for (int i=0; i<256; i++) // Check if all counts become 0 if (count[i]) return -1; // This part calculates the number of operations required int res = 0; for (int i=n-1, j=n-1; i>=0; ) { // If there is a mismatch, then keep incrementing // result 'res' until B[j] is not found in A[0..i] while (i>=0 && A[i] != B[j]) { i--; res++; } // If A[i] and B[j] match if (i >= 0) { i--; j--; } } return res;}