Given two binary strings S1 and S2 of size N and M respectively, the task is to find the minimum number of reversal of substrings of equal characters required to convert the string S1 to S2. If it is not possible to convert the string S1 to S2, then print “-1”.
Examples:
Input: S1 = “100001”, S2 = “110111”
Output: 2
Explanation:
Initially string S1 = “100001”.
Reversal 1: Reverse the substring S1[1, 1], then the string S1 becomes “110001”.
Reversal 2: Reverse the substring S1[3, 4], then the string S1 becomes “110111”.
After the above reversals, the string S1 and S2 are equal.
Therefore, the count of reversals is 2.Input: S1 = 101, S2 = 10
Output: -1
Approach: Follow the below steps to solve this problem:
- Initialize a variable, say answer, to store the resultant count of reversal required.
- If the length of the given strings S1 and S2 are not the same, then print “-1”.
- Iterate over the range [0, N – 1] and perform the following steps:
- If S1[i] and S2[i] are not the same, then iterate till S1[i] and S2[i] are the same. Increment the answer by 1 as the current substring needs to be flipped.
- Otherwise, continue to the next iteration.
- After completing the above steps, print the value of the answer as the resultant flipping of substrings required.
Below is the implementation of the above approach:
C++
// C++ program for the above approach#include <bits/stdc++.h>using namespace std;// Function to count the minimum number// of reversals required to make the// given binary strings s1 and s2 sameint canMakeSame(string s1, string s2){ // Stores the minimum count of // reversal of substrings required int ans = 0; // If the length of the strings // are not the same then return -1 if (s1.size() != s2.size()) { return -1; } int N = s1.length(); // Iterate over each character for (int i = 0; i < N; i++) { // If s1[i] is not // equal to s2[i] if (s1[i] != s2[i]) { // Iterate until s1[i] != s2[i] while (i < s1.length() && s1[i] != s2[i]) { i++; } // Increment answer by 1 ans++; } } // Return the resultant count of // reversal of substring required return ans;}// Driver Codeint main(){ string S1 = "100001"; string S2 = "110111"; // Function Call cout << canMakeSame(S1, S2); return 0;} |
Java
// Java program for the above approachimport java.io.*;class GFG { // Function to count the minimum number // of reversals required to make the // given binary strings s1 and s2 same static int canMakeSame(String s1, String s2) { // Stores the minimum count of // reversal of substrings required int ans = 0; // If the length of the strings // are not the same then return -1 if (s1.length() != s2.length()) { return -1; } int N = s1.length(); // Iterate over each character for (int i = 0; i < N; i++) { // If s1[i] is not // equal to s2[i] if (s1.charAt(i) != s2.charAt(i)) { // Iterate until s1[i] != s2[i] while (i < s1.length() && s1.charAt(i) != s2.charAt(i)) { i++; } // Increment answer by 1 ans++; } } // Return the resultant count of // reversal of substring required return ans; } // Driver Code public static void main(String[] args) { String S1 = "100001"; String S2 = "110111"; // Function Call System.out.println(canMakeSame(S1, S2)); }}// This code is contributed by Dharanendra L V |
Python3
# Python3 program for the above approach# Function to count the minimum number# of reversals required to make the# given binary strings s1 and s2 samedef canMakeSame(s1, s2) : # Stores the minimum count of # reversal of substrings required ans = -1 # If the length of the strings # are not the same then return -1 if (len(s1) != len(s2)) : return -1 N = len(s1) # Iterate over each character for i in range(0, N): # If s1[i] is not # equal to s2[i] if (s1[i] != s2[i]) : # Iterate until s1[i] != s2[i] while (i < len(s1) and s1[i] != s2[i]) : i += 1 # Increment answer by 1 ans += 1 # Return the resultant count of # reversal of subrequired return ans# Driver CodeS1 = "100001"S2 = "110111"# Function Callprint(canMakeSame(S1, S2))# This code is contributed by code_hunt. |
C#
// C# program for the above approachusing System;class GFG{ // Function to count the minimum number // of reversals required to make the // given binary strings s1 and s2 same static int canMakeSame(string s1, string s2) { // Stores the minimum count of // reversal of substrings required int ans = 0; // If the length of the strings // are not the same then return -1 if (s1.Length != s2.Length) { return -1; } int N = s1.Length; // Iterate over each character for (int i = 0; i < N; i++) { // If s1[i] is not // equal to s2[i] if (s1[i] != s2[i]) { // Iterate until s1[i] != s2[i] while (i < s1.Length && s1[i] != s2[i]) { i++; } // Increment answer by 1 ans++; } } // Return the resultant count of // reversal of substring required return ans; }// Driver Codepublic static void Main(string[] args){ string S1 = "100001"; string S2 = "110111"; // Function Call Console.Write(canMakeSame(S1, S2));}}// This code is contributed by susmitakundugoaldanga. |
Javascript
<script>// JavaScript program for the above approach// Function to count the minimum number// of reversals required to make the// given binary strings s1 and s2 samefunction canMakeSame(s1, s2){ // Stores the minimum count of // reversal of substrings required var ans = 0; // If the length of the strings // are not the same then return -1 if (s1.length != s2.length) { return -1; } var N = s1.length; // Iterate over each character for (var i = 0; i < N; i++) { // If s1[i] is not // equal to s2[i] if (s1[i] != s2[i]) { // Iterate until s1[i] != s2[i] while (i < s1.length && s1[i] != s2[i]) { i++; } // Increment answer by 1 ans++; } } // Return the resultant count of // reversal of substring required return ans;}// Driver Codevar S1 = "100001";var S2 = "110111";// Function Calldocument.write( canMakeSame(S1, S2));</script> |
Output:
2
Time Complexity: O(N)
Auxiliary Space: O(1)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
