Check whether given string can be generated after concatenating given strings
Last Updated :
12 Oct, 2022
Given three strings str, A and B. The task is to check whether str = A + B or str = B + A where + denotes concatenation.
Examples:
Input: str = "GeeksforGeeks", A = "Geeksfo", B = "rGeeks"
Output: Yes
str = A + B = "Geeksfo" + "rGeeks" = "GeeksforGeeks"
Input: str = "Delhicapitals", B = "Delmi", C = "capitals"
Output: No
Approach:
- If len(str) != len(A) + len(B) then it is not possible to generate str by concatenating a + b or b + a.
- Else check whether str starts with a and ends with b or it starts with b and ends with a. Print Yes if any of these is true else print No
Below is the implementation of the above approach:
C++
// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
// Function that return true
// if pre is a prefix of str
bool startsWith(string str, string pre)
{
int strLen = str.length();
int preLen = pre.length();
int i = 0, j = 0;
// While there are characters to match
while (i < strLen && j < preLen) {
// If characters differ at any position
if (str[i] != pre[j])
return false;
i++;
j++;
}
// str starts with pre
return true;
}
// Function that return true
// if suff is a suffix of str
bool endsWith(string str, string suff)
{
int i = str.length() - 0;
int j = suff.length() - 0;
// While there are characters to match
while (i >= 0 && j >= 0) {
// If characters differ at any position
if (str[i] != suff[j])
return false;
i--;
j--;
}
// str ends with suff
return true;
}
// Function that returns true
// if str = a + b or str = b + a
bool checkString(string str, string a, string b)
{
// str cannot be generated
// by concatenating a and b
if (str.length() != a.length() + b.length())
return false;
// If str starts with a
// i.e. a is a prefix of str
if (startsWith(str, a)) {
// Check if the rest of the characters
// are equal to b i.e. b is a suffix of str
if (endsWith(str, b))
return true;
}
// If str starts with b
// i.e. b is a prefix of str
if (startsWith(str, b)) {
// Check if the rest of the characters
// are equal to a i.e. a is a suffix of str
if (endsWith(str, a))
return true;
}
return false;
}
// Driver code
int main()
{
string str = "GeeksforGeeks";
string a = "Geeksfo";
string b = "rGeeks";
if (checkString(str, a, b))
cout << "Yes";
else
cout << "No";
return 0;
}
// Java implementation of the approach
import java.util.*;
class GFG
{
// Function that return true
// if pre is a prefix of str
static boolean startsWith(String str, String pre)
{
int strLen = str.length();
int preLen = pre.length();
int i = 0, j = 0;
// While there are characters to match
while (i < strLen && j < preLen)
{
// If characters differ at any position
if (str.charAt(i) != pre.charAt(j))
return false;
i++;
j++;
}
// str starts with pre
return true;
}
// Function that return true
// if suff is a suffix of str
static boolean endsWith(String str, String suff)
{
int i = str.length() - 1;
int j = suff.length() - 1;
// While there are characters to match
while (i >= 0 && j >= 0)
{
// If characters differ at any position
if (str.charAt(i) != suff.charAt(j))
return false;
i--;
j--;
}
// str ends with suff
return true;
}
// Function that returns true
// if str = a + b or str = b + a
static boolean checkString(String str, String a, String b)
{
// str cannot be generated
// by concatenating a and b
if (str.length() != a.length() + b.length())
return false;
// If str starts with a
// i.e. a is a prefix of str
if (startsWith(str, a))
{
// Check if the rest of the characters
// are equal to b i.e. b is a suffix of str
if (endsWith(str, b))
return true;
}
// If str starts with b
// i.e. b is a prefix of str
if (startsWith(str, b))
{
// Check if the rest of the characters
// are equal to a i.e. a is a suffix of str
if (endsWith(str, a))
return true;
}
return false;
}
// Driver code
public static void main(String args[])
{
String str = "GeeksforGeeks";
String a = "Geeksfo";
String b = "rGeeks";
if (checkString(str, a, b))
System.out.println("Yes");
else
System.out.println("No");
}
}
// This code is contributed by Arnab Kundu
# Python3 implementation of the approach
# Function that return true
# if pre is a prefix of str
def startsWith(str, pre):
strLen = len(str)
preLen = len(pre)
i = 0
j = 0
# While there are characters to match
while (i < strLen and j < preLen):
# If characters differ at any position
if (str[i] != pre[j]) :
return False
i += 1
j += 1
# str starts with pre
return True
# Function that return true
# if suff is a suffix of str
def endsWith(str, suff):
i = len(str) - 1
j = len(suff) - 1
# While there are characters to match
while (i >= 0 and j >= 0):
# If characters differ at any position
if (str[i] != suff[j]):
return False
i -= 1
j -= 1
# str ends with suff
return True
# Function that returns true
# if str = a + b or str = b + a
def checkString(str, a, b):
# str cannot be generated
# by concatenating a and b
if (len(str) != len(a) + len(b)):
return False
# If str starts with a
# i.e. a is a prefix of str
if (startsWith(str, a)):
# Check if the rest of the characters
# are equal to b i.e. b is a suffix of str
if (endsWith(str, b)):
return True
# If str starts with b
# i.e. b is a prefix of str
if (startsWith(str, b)):
# Check if the rest of the characters
# are equal to a i.e. a is a suffix of str
if (endsWith(str, a)):
return True
return False
# Driver code
str = "GeeksforGeeks"
a = "Geeksfo"
b = "rGeeks"
if (checkString(str, a, b)):
print("Yes")
else:
print("No")
# This code is contributed by SHUBHAMSINGH10
// C# implementation of the approach
using System;
class GFG
{
// Function that return true
// if pre is a prefix of str
static Boolean startsWith(String str,
String pre)
{
int strLen = str.Length;
int preLen = pre.Length;
int i = 0, j = 0;
// While there are characters to match
while (i < strLen && j < preLen)
{
// If characters differ at any position
if (str[i] != pre[j])
return false;
i++;
j++;
}
// str starts with pre
return true;
}
// Function that return true
// if suff is a suffix of str
static Boolean endsWith(String str,
String suff)
{
int i = str.Length - 1;
int j = suff.Length - 1;
// While there are characters to match
while (i >= 0 && j >= 0)
{
// If characters differ at any position
if (str[i] != suff[j])
return false;
i--;
j--;
}
// str ends with suff
return true;
}
// Function that returns true
// if str = a + b or str = b + a
static Boolean checkString(String str,
String a,
String b)
{
// str cannot be generated
// by concatenating a and b
if (str.Length != a.Length + b.Length)
return false;
// If str starts with a
// i.e. a is a prefix of str
if (startsWith(str, a))
{
// Check if the rest of the characters
// are equal to b i.e. b is a suffix of str
if (endsWith(str, b))
return true;
}
// If str starts with b
// i.e. b is a prefix of str
if (startsWith(str, b))
{
// Check if the rest of the characters
// are equal to a i.e. a is a suffix of str
if (endsWith(str, a))
return true;
}
return false;
}
// Driver code
public static void Main(String []args)
{
String str = "GeeksforGeeks";
String a = "Geeksfo";
String b = "rGeeks";
if (checkString(str, a, b))
Console.WriteLine("Yes");
else
Console.WriteLine("No");
}
}
// This code is contributed by 29AjayKumar
<?php
// PHP implementation of the approach
// Function that return true
// if pre is a prefix of str
function startsWith($str, $pre)
{
$strLen = strlen($str);
$preLen = strlen($pre);
$i = 0; $j = 0;
// While there are characters to match
while ($i < $strLen && $j < $preLen)
{
// If characters differ at any position
if ($str[$i] != $pre[$j])
return false;
$i++;
$j++;
}
// str starts with pre
return true;
}
// Function that return true
// if suff is a suffix of str
function endsWith($str, $suff)
{
$i = strlen($str)- 0;
$j = strlen($suff)- 0;
// While there are characters to match
while ($i >= 0 && $j >= 0)
{
// If characters differ at any position
if ($str[$i] != $suff[$j])
return false;
$i--;
$j--;
}
// str ends with suff
return true;
}
// Function that returns true
// if str = a + b or str = b + a
function checkString($str, $a, $b)
{
// str cannot be generated
// by concatenating a and b
if (strlen($str) != strlen($a) + strlen($b))
return false;
// If str starts with a
// i.e. a is a prefix of str
if (startsWith($str, $a))
{
// Check if the rest of the characters
// are equal to b i.e. b is a suffix of str
if (endsWith($str, $b))
return true;
}
// If str starts with b
// i.e. b is a prefix of str
if (startsWith($str, $b))
{
// Check if the rest of the characters
// are equal to a i.e. a is a suffix of str
if (endsWith($str, $a))
return true;
}
return false;
}
// Driver code
$str = "GeeksforGeeks";
$a = "Geeksfo";
$b = "rGeeks";
if (checkString($str, $a, $b))
echo "Yes";
else
echo "No";
// This code is contributed by AnkitRai01
?>
<script>
// JavaScript implementation of the approach
// Function that return true
// if pre is a prefix of str
function startsWith(str, pre)
{
let strLen = str.length;
let preLen = pre.length;
let i = 0, j = 0;
// While there are characters to match
while (i < strLen && j < preLen)
{
// If characters differ at any position
if (str[i] != pre[j])
return false;
i++;
j++;
}
// str starts with pre
return true;
}
// Function that return true
// if suff is a suffix of str
function endsWith(str, suff)
{
let i = str.length - 1;
let j = suff.length - 1;
// While there are characters to match
while (i >= 0 && j >= 0)
{
// If characters differ at any position
if (str[i] != suff[j])
return false;
i--;
j--;
}
// str ends with suff
return true;
}
// Function that returns true
// if str = a + b or str = b + a
function checkString(str, a, b)
{
// str cannot be generated
// by concatenating a and b
if (str.length != a.length + b.length)
return false;
// If str starts with a
// i.e. a is a prefix of str
if (startsWith(str, a))
{
// Check if the rest of the characters
// are equal to b i.e. b is a suffix of str
if (endsWith(str, b))
return true;
}
// If str starts with b
// i.e. b is a prefix of str
if (startsWith(str, b))
{
// Check if the rest of the characters
// are equal to a i.e. a is a suffix of str
if (endsWith(str, a))
return true;
}
return false;
}
let str = "GeeksforGeeks";
let a = "Geeksfo";
let b = "rGeeks";
if (checkString(str, a, b))
document.write("Yes");
else
document.write("No");
</script>
Time Complexity: O(max(a,b,c)), as we are using a loop to traverse a, b, and c times. Where a, b, and c are the length of the strings.
Auxiliary Space: O(1), as we are not using any extra space.
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read
Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an
8 min read