Skip to content
Related Articles

Related Articles

Generate a string which differs by only a single character from all given strings
  • Last Updated : 27 Aug, 2020

Given an array of strings str[] of length N, consisting of strings of the same length, the task is to find the string which only differs by a single character from all the given strings. If no such string can be generated, print -1. In case of multiple possible answers, print any of them.

Example:

Input: str[] = { “abac”, “zdac”, “bdac”} 
Output: adac 
Explanation: 
The string “adac” differs from all the given strings by a single character.

Input: str[] = { “geeks”, “teeds”} 
Output: teeks

Approach: Follow the steps below to solve the problem: 
 



  • Set the first string as the answer.
  • Now, replace the first character of the string to all possible characters and check if it differs by a single character from the other strings or not.
  • Repeat this process for all the characters in the first string.
  • If any such string of the required type is found from the above step, print the string.
  • If no such situation arises where replacing a single character of the first string generates a string of the required type, print -1.

Below is the implementation of the above approach.

C++




// C++ Program to implement
// the above approach
#include <bits/stdc++.h>
#define ll long long
 
using namespace std;
 
// Function to check if a given string
// differs by a single character from
// all the strings in an array
bool check(string ans, vector<string>& s,
           int n, int m)
{
 
    // Traverse over the srings
    for (int i = 1; i < n; ++i) {
 
        // Stores the count of characters
        // differing from the strings
        int count = 0;
        for (int j = 0; j < m; ++j) {
            if (ans[j] != s[i][j])
                count++;
        }
 
        // If differs by more than one
        // character
        if (count > 1)
            return false;
    }
 
    return true;
}
 
// Function to find the string which only
// differ at one position from the all
// given strings of the array
string findString(vector<string>& s)
{
 
    // Size of the array
    int n = s.size();
 
    // Length of a string
    int m = s[0].size();
 
    string ans = s[0];
 
    int flag = 0;
 
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < 26; ++j) {
 
            string x = ans;
 
            // Replace i-th character by all
            // possible characters
            x[i] = (j + 'a');
 
            // Check if it differs by a
            // single character from all
            // other strings
            if (check(x, s, n, m)) {
                ans = x;
                flag = 1;
                break;
            }
        }
 
        // If desired string is obtained
        if (flag == 1)
            break;
    }
 
    // Print the answer
    if (flag == 0)
        return "-1";
    else
        return ans;
}
 
// Driver code
int main()
{
 
    vector<string> s = { "geeks", "teeds" };
 
    // Function call
    cout << findString(s) << endl;
}
Java



// Java program to implement
// the above approach
import java.util.*;
 
class GFG{
     
// Function to check if a given string
// differs by a single character from
// all the strings in an array
static boolean check(String ans, String[] s,
                     int n, int m)
{
     
    // Traverse over the srings
    for(int i = 1; i < n; ++i)
    {
         
        // Stores the count of characters
        // differing from the strings
        int count = 0;
        for(int j = 0; j < m; ++j)
        {
            if (ans.charAt(j) != s[i].charAt(j))
                count++;
        }
 
        // If differs by more than one
        // character
        if (count > 1)
            return false;
    }
    return true;
}
 
// Function to find the string which only
// differ at one position from the all
// given strings of the array
static String findString(String[] s)
{
     
    // Size of the array
    int n = s.length;
    String ans = s[0];
     
    // Length of a string
    int m = ans.length();
 
    int flag = 0;
 
    for(int i = 0; i < m; ++i)
    {
        for(int j = 0; j < 26; ++j)
        {
            String x = ans;
 
            // Replace i-th character by all
            // possible characters
            x = x.replace(x.charAt(i), (char)(j + 'a'));
 
            // Check if it differs by a
            // single character from all
            // other strings
            if (check(x, s, n, m))
            {
                ans = x;
                flag = 1;
                break;
            }
        }
 
        // If desired string is obtained
        if (flag == 1)
            break;
    }
 
    // Print the answer
    if (flag == 0)
        return "-1";
    else
        return ans;
}
 
// Driver code
public static void main(String []args)
{
    String s[] = { "geeks", "teeds" };
 
    // Function call
    System.out.println(findString(s));
}
}
 
// This code is contributed by chitranayal
Python3



# Python3 program to implement
# the above approach
 
# Function to check if a given string
# differs by a single character from
# all the strings in an array
def check(ans, s, n, m):
 
    # Traverse over the srings
    for i in range(1, n):
 
        # Stores the count of characters
        # differing from the strings
        count = 0
        for j in range(m):
            if(ans[j] != s[i][j]):
                count += 1
 
        # If differs by more than one
        # character
        if(count > 1):
            return False
 
    return True
 
# Function to find the string which only
# differ at one position from the all
# given strings of the array
def findString(s):
 
    # Size of the array
    n = len(s)
 
    # Length of a string
    m = len(s[0])
 
    ans = s[0]
    flag = 0
 
    for i in range(m):
        for j in range(26):
            x = list(ans)
 
            # Replace i-th character by all
            # possible characters
            x[i] = chr(j + ord('a'))
 
            # Check if it differs by a
            # single character from all
            # other strings
            if(check(x, s, n, m)):
                ans = x
                flag = 1
                break
 
        # If desired string is obtained
        if(flag == 1):
            break
 
    # Print the answer
    if(flag == 0):
        return "-1"
    else:
        return ''.join(ans)
 
# Driver Code
 
# Given array of strings
s = [ "geeks", "teeds" ]
 
# Function call
print(findString(s))
 
# This code is contributed by Shivam Singh
C#



// C# program to implement
// the above approach
using System;
class GFG{
     
// Function to check if a given string
// differs by a single character from
// all the strings in an array
static bool check(String ans, String[] s,
                  int n, int m)
{
     
    // Traverse over the srings
    for(int i = 1; i < n; ++i)
    {
         
        // Stores the count of characters
        // differing from the strings
        int count = 0;
        for(int j = 0; j < m; ++j)
        {
            if (ans[j] != s[i][j])
                count++;
        }
 
        // If differs by more than one
        // character
        if (count > 1)
            return false;
    }
    return true;
}
 
// Function to find the string which only
// differ at one position from the all
// given strings of the array
static String findString(String[] s)
{
     
    // Size of the array
    int n = s.Length;
    String ans = s[0];
     
    // Length of a string
    int m = ans.Length;
 
    int flag = 0;
 
    for(int i = 0; i < m; ++i)
    {
        for(int j = 0; j < 26; ++j)
        {
            String x = ans;
 
            // Replace i-th character by all
            // possible characters
            x = x.Replace(x[i], (char)(j + 'a'));
 
            // Check if it differs by a
            // single character from all
            // other strings
            if (check(x, s, n, m))
            {
                ans = x;
                flag = 1;
                break;
            }
        }
 
        // If desired string is obtained
        if (flag == 1)
            break;
    }
 
    // Print the answer
    if (flag == 0)
        return "-1";
    else
        return ans;
}
 
// Driver code
public static void Main(String []args)
{
    String []s = { "geeks", "teeds" };
 
    // Function call
    Console.WriteLine(findString(s));
}
}
 
// This code is contributed by Rajput-Ji
Output: 
teeks




 
Time Complexity: O(N * M2 * 26)
Auxiliary Space: O(M)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
My Personal Notes
arrow_drop_up
Previous
Amazon Interview Experience for SDE-1 FTE/6 Months Internship – AmazeWow
Next

Count number of times each Edge appears in all possible paths of a given Tree
Recommended Articles
Page :
Lexicographically smallest string which differs from given strings at exactly K indices
20, Jun 20
Partition a string into palindromic strings of at least length 2 with every character present in a single string
23, Mar 21
Maximum sub-sequence sum such that indices of any two adjacent elements differs at least by 3
26, Jun 19
Generate two output strings depending upon occurrence of character in input string.
07, Oct 17
Generate two output strings depending upon occurrence of character in input string in Python
27, Dec 17
Count substrings of same length differing by a single character from two given strings
17, Nov 20
Replace all occurrences of character X with character Y in given string
13, Jul 20
Pairs of strings which on concatenating contains each character of "string"
04, Apr 19
Convert the string into palindrome string by changing only one character
22, Jan 18
Generate a String from given Strings P and Q based on the given conditions
19, Aug 20
Generate all binary strings of length n with sub-string "01" appearing exactly twice
02, Apr 19
Count of strings possible by replacing two consecutive same character with new character
30, Mar 20
Number of permutations of a string in which all the occurrences of a given character occurs together
30, Oct 18
Map every character of one string to another such that all occurrences are mapped to the same character
16, Jul 19
Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
16, Nov 18
Print all strings from given array that can be typed using keys from a single row of a QWERTY keyboard
23, Nov 20
Count minimum substring removals required to reduce string to a single distinct character
07, Dec 20
Generate all binary strings from given pattern
15, Jun 16
Generate a string from an array of alphanumeric strings based on given conditions
02, Sep 20
Generate a string whose all K-size substrings can be concatenated to form the given string
25, Jun 20
Number of strings which starts and ends with same character after rotations
21, May 20
Generate an array B[] from the given array A[] which satisfies the given conditions
21, Oct 19
Minimize the length of string by removing occurrence of only one character
08, Oct 18
Count subarrays made up of single-digit integers only
01, Feb 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
dreamer07
@dreamer07
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox