Find if an array contains a string with one mismatch
Last Updated :
26 Apr, 2023
Given a string and array of strings, find whether the array contains a string with one character difference from the given string. Array may contain strings of different lengths.
Examples:
Input : str = "banana"
arr[] = {"bana", "apple", "banaba",
bonanzo", "banamf"}
Output :True
Explanation:-There is only a one character difference
between banana and banaba
Input : str = "banana"
arr[] = {"bana", "apple", "banabb", bonanzo",
"banamf"}
Output : False
We traverse through given string and check for every string in arr. Follow the two steps as given below for every string contained in arr:-
- Check whether the string contained in arr is of the same length as the target string.
- If yes, then check if there is only one character mismatch, if yes then return true else return false.
Implementation:
C++
// C++ program to find if given string is present
// with one mismatch.
#include <bits/stdc++.h>
using namespace std;
bool check(vector<string> list, string s)
{
int n = (int)list.size();
// If the array is empty
if (n == 0)
return false;
for (int i = 0; i < n; i++) {
// If sizes are same
if (list[i].size() != s.size())
continue;
bool diff = false;
for (int j = 0; j < (int)list[i].size(); j++) {
if (list[i][j] != s[j]) {
// If first mismatch
if (!diff)
diff = true;
// Second mismatch
else {
diff = false;
break;
}
}
}
if (diff)
return true;
}
return false;
}
// Driver code
int main()
{
vector<string> s;
s.push_back("bana");
s.push_back("apple");
s.push_back("banacb");
s.push_back("bonanza");
s.push_back("banamf");
cout << check(s, "banana");
return 0;
}
import java.util.*;
// Java program to find if
// given string is present
// with one mismatch.
class GFG
{
static boolean check(Vector<String> list, String s)
{
int n = (int) list.size();
// If the array is empty
if (n == 0)
{
return false;
}
for (int i = 0; i < n; i++)
{
// If sizes are same
if (list.get(i).length() != s.length())
{
continue;
}
boolean diff = false;
for (int j = 0; j < (int) list.get(i).length(); j++)
{
if (list.get(i).charAt(j) != s.charAt(j))
{
// If first mismatch
if (!diff)
{
diff = true;
}
// Second mismatch
else
{
diff = false;
break;
}
}
}
if (diff) {
return true;
}
}
return false;
}
// Driver code
public static void main(String[] args)
{
Vector<String> s = new Vector<>();
s.add("bana");
s.add("apple");
s.add("banacb");
s.add("bonanza");
s.add("banamf");
System.out.println(check(s, "banana") == true ? 1 : 0);
}
}
/* This code contributed by PrinciRaj1992 */
# Python 3 program to find if given
# string is present with one mismatch.
def check(list, s):
n = len(list)
# If the array is empty
if (n == 0):
return False
for i in range(0, n, 1):
# If sizes are same
if (len(list[i]) != len(s)):
continue
diff = False
for j in range(0, len(list[i]), 1):
if (list[i][j] != s[j]):
# If first mismatch
if (diff == False):
diff = True
# Second mismatch
else:
diff = False
break
if (diff):
return True
return False
# Driver code
if __name__ == '__main__':
s = []
s.append("bana")
s.append("apple")
s.append("banacb")
s.append("bonanza")
s.append("banamf")
print(int(check(s, "banana")))
# This code is contributed by
# Sahil_shelangia
// C# program to find if
// given string is present
// with one mismatch.
using System;
using System.Collections.Generic;
public class GFG
{
static bool check(List<String> list, String s)
{
int n = (int) list.Count;
// If the array is empty
if (n == 0)
{
return false;
}
for (int i = 0; i < n; i++)
{
// If sizes are same
if (list[i].Length != s.Length)
{
continue;
}
bool diff = false;
for (int j = 0; j < (int) list[i].Length; j++)
{
if (list[i][j] != s[j])
{
// If first mismatch
if (!diff)
{
diff = true;
}
// Second mismatch
else
{
diff = false;
break;
}
}
}
if (diff) {
return true;
}
}
return false;
}
// Driver code
public static void Main(String[] args)
{
List<String> s = new List<String>();
s.Add("bana");
s.Add("apple");
s.Add("banacb");
s.Add("bonanza");
s.Add("banamf");
Console.WriteLine(check(s, "banana") == true ? 1 : 0);
}
}
// This code has been contributed by 29AjayKumar
<script>
// Javascript program to find if
// given string is present
// with one mismatch.
function check(list, s)
{
let n = list.length;
// If the array is empty
if (n == 0)
{
return false;
}
for (let i = 0; i < n; i++)
{
// If sizes are same
if (list[i].length != s.length)
{
continue;
}
let diff = false;
for (let j = 0; j < list[i].length; j++)
{
if (list[i][j] != s[j])
{
// If first mismatch
if (!diff)
{
diff = true;
}
// Second mismatch
else
{
diff = false;
break;
}
}
}
if (diff) {
return true;
}
}
return false;
}
let s = [];
s.push("bana");
s.push("apple");
s.push("banacb");
s.push("bonanza");
s.push("banamf");
document.write(check(s, "banana") == true ? 1 : 0);
</script>
Time complexity: O(n2)
Auxiliary space: O(1)
Approach#2: Using sorting
One more approach is to sort the array and then loop through each string in the array. For each string, compare it with the given string character by character and count the number of mismatches. If the count of mismatches is equal to 1, then return True.
Algorithm
1. Sort the array
2. Loop through each string in the array
3. Initialize a variable 'count' to 0
4. Loop through each character in the string
5. If the character in the given string at index 'i' is not equal to the character in the current string at index 'i', increment 'count' by 1
6. If 'count' becomes more than 1 or if the length of the string in the array is less than the length of the given string minus 1, continue to the next string
7. If the length of the string in the array is greater than the length of the given string plus 1, break out of the loop
8. If 'count' is equal to 1 and the length of the string in the array is either equal to the length of the given string or the length of the given string minus 1, return True
9. If the loop completes without finding a match, return False
C++
#include <bits/stdc++.h>
using namespace std;
// Function to check if there is one mismatch between str and any string in arr
bool has_one_mismatch(string str, vector<string> arr) {
sort(arr.begin(), arr.end());
for (string s : arr) {
int count = 0;
int i = 0;
while (i < s.length() && count <= 1) {
if (str[i] != s[i]) {
count += 1;
}
i += 1;
}
if (count > 1 || s.length() < str.length()-1) {
continue;
}
if (s.length() > str.length()+1) {
break;
}
if (count == 1 && (s.length() == str.length() || s.length() == str.length()-1)) {
return true;
}
}
return false;
}
// Driver code
int main() {
string str = "banana";
vector<string> arr = {"bana", "apple", "banaba", "bonanzo", "banamf"};
if(has_one_mismatch(str, arr)) cout<<"True";
else cout<<"False";
}
import java.util.*;
public class Main {
// Function to check if there is one mismatch between
// str and any string in arr
public static boolean
has_one_mismatch(String str, ArrayList<String> arr)
{
Collections.sort(arr);
for (String s : arr) {
int count = 0;
int i = 0;
while (i < s.length() && count <= 1) {
if (str.charAt(i) != s.charAt(i)) {
count += 1;
}
i += 1;
}
if (count > 1
|| s.length() < str.length() - 1) {
continue;
}
if (s.length() > str.length() + 1) {
break;
}
if (count == 1
&& (s.length() == str.length()
|| s.length() == str.length() - 1)) {
return true;
}
}
return false;
}
// driver code
public static void main(String[] args)
{
String str = "banana";
ArrayList<String> arr = new ArrayList<String>(
Arrays.asList("bana", "apple", "banaba",
"bonanzo", "banamf"));
if (has_one_mismatch(str, arr))
System.out.println("True");
else
System.out.println("False");
}
}
def has_one_mismatch(str, arr):
arr.sort()
for s in arr:
count = 0
i = 0
while i < len(s) and count <= 1:
if str[i] != s[i]:
count += 1
i += 1
if count > 1 or len(s) < len(str)-1:
continue
if len(s) > len(str)+1:
break
if count == 1 and (len(s) == len(str) or len(s) == len(str)-1):
return True
return False
str = "banana"
arr= ["bana", "apple", "banaba",
"bonanzo", "banamf"]
print(has_one_mismatch(str, arr))
using System;
using System.Collections.Generic;
using System.Linq;
class Program
{
// Function to check if there is one mismatch between
// str and any string in arr
static bool HasOneMismatch(string str, List<string> arr)
{
arr.Sort();
foreach(string s in arr)
{
int count = 0;
int i = 0;
while (i < s.Length && count <= 1) {
if (str[i] != s[i]) {
count += 1;
}
i += 1;
}
if (count > 1 || s.Length < str.Length - 1) {
continue;
}
if (s.Length > str.Length + 1) {
break;
}
if (count == 1
&& (s.Length == str.Length
|| s.Length == str.Length - 1)) {
return true;
}
}
return false;
}
// driver code
static void Main(string[] args)
{
string str = "banana";
List<string> arr
= new List<string>{ "bana", "apple", "banaba",
"bonanzo", "banamf" };
if (HasOneMismatch(str, arr))
Console.WriteLine("True");
else
Console.WriteLine("False");
}
}
// JavaScript code to check if a string has one mismatch
function has_one_mismatch(str, arr) {
arr.sort();
for (let s of arr) {
let count = 0;
let i = 0;
while (i < s.length && count <= 1) {
if (str[i] != s[i]) {
count += 1;
}
i += 1;
}
if (count > 1 || s.length < str.length - 1) {
continue;
}
if (s.length > str.length + 1) {
break;
}
if (count == 1 && (s.length == str.length || s.length == str.length - 1)) {
return true;
}
}
return false;
}
let str = "banana";
let arr = ["bana", "apple", "banaba", "bonanzo", "banamf"];
console.log(has_one_mismatch(str, arr));
Time Complexity: O(nmlog(m)), where n is the length of the array and m is the length of the longest string in the array or the given string
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem