Check if two strings can be made equal by swapping pairs of adjacent characters

Check if a two character string can be made using given words

Last Updated : 20 Jul, 2022

Given a string of two characters and n distinct words of two characters. The task is to find if it is possible to arrange given words in such a way that the concatenated string has the given two character string as a substring. We can append a word multiple times.

Examples:

Input : str = "ya"
        words[] = {"ah", "oy", "to", "ha"} 
Output : YES
We can join "oy" and then "ah", and
then "ha" to form the string "oyahha" 
which contains the string "ya".
 So, the answer is "YES"

Input : str[] = "ha"
        words[] = "ah"
Output :YES
The string "ahah" contains "ha" 
as a substring.

Input : str = "hp"
       words[] = {"ht", "tp"|
Output :NO
We can't produce a string containing
"hp" as a sub-string. Note that we
can join "ht" and then "tp" producing
"http", but it doesn't contain the 
"hp" as a sub-string.

If we look at the given examples carefully, we can see that our answer will be “YES” if any of the following conditions is true,

str is equal to any one of the N words
str is equal to reverse of any of the words.
It first letter of str is equal to last letter of any of the given N strings and last letter is equal to the first letter of any of the given N strings.

Otherwise our output will always be NO.

Below is the implementation of the above approach.

C++

Java

Python3

C#

PHP

Javascript

Output

Yes

Time Complexity: O(n), where n represents the size of the given vector.
Auxiliary Space: O(1), no extra space is required, so it is a constant.

Check if two strings can be made equal by swapping pairs of adjacent characters

GeeksforGeeks

Improve

Article Tags :

Practice Tags :

Similar Reads

Check if a given string is made up of two alternating characters

Given a string str, the task is to check whether the given string is made up of only two alternating characters.Examples: Input: str = "ABABABAB" Output: YesInput: str = "XYZ" Output: No Recommended: Please try your approach on {IDE} first, before moving on to the solution.Approach: In order for the

Check if characters of a given string can be used to form any N equal strings

Given a string S and an integer N, the task is to check if it is possible to generate any string N times from the characters of the given string or not. If it is possible, print Yes. Otherwise, print No. Examples: Input: S = "caacbb", N = 2Output: YesExplanation: All possible strings that can be gen

Check if two strings can be made equal by swapping pairs of adjacent characters

Given two strings A and B of length N and M respectively and an array arr[] consisting of K integers, the task is to check if the string B can be obtained from the string A by swapping any pair of adjacent characters of the string A any number of times such that the swapped indices are not present i

Check if given words are present in a string

Given a big string and an array of small strings, all of which are smaller in length than the big string. The task is to create an array of booleans, where each boolean represents whether the small string at that index in the array of small strings is contained in the big string. Note : that you can

Check if number of distinct characters in 2 Strings can be made equal

Given two strings A and B of lowercase English letters of lengths N and M respectively. Check whether the number of distinct characters in both strings A and B can be made equal by applying the operation at most one time. Where operation is: Choose any index i such that 0 â‰¤ i â‰¤ N from string A and i

Check if a given string can be formed using characters of adjacent cells of a Matrix

Given a matrix board of characters and a string Word, the task is to check if Word exists on the board constructed from a sequence of horizontally and vertically adjacent characters only. Each character can be used only once. Examples: Input: board = { {'A', 'B', 'C', 'E'}, {'S', 'F', 'C', 'S'}, {'A

Check if given strings can be made same by swapping two characters of same or different strings

Given an array of equal-length strings, arr[] of size N, the task is to check if all the strings can be made equal by repeatedly swapping any pair of characters of same or different strings from the given array. If found to be true, then print "YES". Otherwise, print "NO". Examples: Input: arr[] = {

First and last character of each word in a String

Given a string s consisting of multiple words, print the first and last character of each word. If a word contains only one character, print it twice (since the first and last characters are the same).Note: The string will not contain leading or trailing spaces. Examples: Input: s = "Geeks for geeks

Check whether second string can be formed from characters of first string

Given two strings str1 and str2, check if str2 can be formed from str1 Example : Input : str1 = geekforgeeks, str2 = geeksOutput : YesHere, string2 can be formed from string1. Input : str1 = geekforgeeks, str2 = andOutput : NoHere string2 cannot be formed from string1. Input : str1 = geekforgeeks, s

Check if two binary strings can be made equal by swapping pairs of unequal characters

Given two binary strings S1 and S2 of length N (1 ? N ? 105), the task is to check if it is possible to convert the string S1 to S2 by performing the following operations any number of times: Select any two indices i and j (1 ? i < j ? N) such that S1[i] is â€˜0â€™ and S1[j] is â€˜1â€™.Swap S1[i] with S1