Minimum number of pairs required to make two strings same
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. Examples:
Input: s1 = “abb”, s2 = “dad” Output: 2 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” Output: 7
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:
Time Complexity: O(x) where x is the length of the first string.
Space Complexity: O(x) where x is the length of the string
Please Login to comment...