Given two strings s1 and s2 of same length, the task is to count the minimum number of pairs of characters (c1, c2) such that by transforming c1 to c2 or c2 to c1 any number of times in any string make both the strings same.
Input: s1 = “abb”, s2 = “dad”
Transform ‘a’ -> ‘d’, ‘b’ -> ‘a’ and ‘b’ -> ‘a’ -> ‘d’ in s1.
We can not take (a, d), (b, a), (b, d) as pairs because
(b, d) can be achieved by following transformation ‘b’ -> ‘a’ -> ‘d’
Input: s1 = “drpepper”, s2 = “cocacola”
Approach: This Problem can be solved by using Graphs or Disjoint Sets. Build an empty graph G and iterate through the strings. Add an edge in graph G only if one of the following conditions is met:
- Both s1[i] and s2[i] are not in G.
- s1[i] is in G but s2[i] is not in G.
- s2[i] is in G but s1[i] is not in G.
- There is no path from s1[i] to s2[i].
The minimum number of pairs will be the count of edges in the final graph G.
Below is the implementation of the above approach:
- Minimum number of given operations required to make two strings equal
- Minimum Number of Manipulations required to make two Strings Anagram Without Deletion of Character
- Find the minimum number of preprocess moves required to make two strings equal
- Minimum edges required to add to make Euler Circuit
- Minimum array insertions required to make consecutive difference <= K
- Minimum swaps required to make a binary string alternating
- Minimum cost to make two strings same
- Minimum Cost To Make Two Strings Identical
- Minimum cost to make array size 1 by removing larger of pairs
- Minimum move to end operations to make all strings equal
- Minimum Cost to make two Numeric Strings Identical
- Minimum cost to make two strings identical by deleting the digits
- Using Counter() in Python to find minimum character removal to make two strings anagram
- Minimum changes required to make first string substring of second string
- Number of character corrections in the given strings to make them equal
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.