Check if a two character string can be made using given words
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++
// CPP code to check if a two character string can // be made using given strings #include <bits/stdc++.h> using namespace std; // Function to check if str can be made using // given words bool makeAndCheckString(vector<string> words, string str) { int n = words.size(); bool first = false, second = false; for (int i = 0; i < n; i++) { // If str itself is present if (words[i] == str) return true; // Match first character of str // with second of word and vice versa if (str[0] == words[i][1]) first = true; if (str[1] == words[i][0]) second = true; // If both characters found. if (first && second) return true; } return false; } // Driver Code int main() { string str = "ya"; vector<string> words = { "ah", "oy", "to", "ha"}; if (makeAndCheckString(words, str)) cout << "Yes"; else cout << "No"; return 0; } |
chevron_right
filter_none
Java
// Java code to check if a two character string can // be made using given strings import java.util.*; class GFG { // Function to check if str can be made using // given words static boolean makeAndCheckString(Vector<String> words, String str) { int n = words.size(); boolean first = false, second = false; for (int i = 0; i < n; i++) { // If str itself is present if (words.get(i) == str) return true; // Match first character of str // with second of word and vice versa if (str.charAt(0) == words.get(i).charAt(1)) first = true; if (str.charAt(1) == words.get(i).charAt(0)) second = true; // If both characters found. if (first && second) return true; } return false; } // Driver Code public static void main(String[] args) { String str = "ya"; String[] array = { "ah", "oy", "to", "ha"}; Vector<String> words = new Vector<String>(Arrays.asList(array)); if (makeAndCheckString(words, str)) System.out.println("Yes"); else System.out.println("No"); } } // This code is contributed by 29AjayKumar |
chevron_right
filter_none
Python3
# Python3 code to check if a two character string can # be made using given strings # Function to check if str can be made using # given words def makeAndCheckString(words, str): n = len(words) first = second = False for i in range(n): # If str itself is present if words[i]==str: return True # Match first character of str # with second of word and vice versa if str[0] == words[i][1]: first = True if str[1] == words[i][0]: second = True # If both characters found. if first and second: return True return False # Driver Code str = 'ya'words = ['ah', 'oy', 'to', 'ha'] if makeAndCheckString(words, str): print('YES') else: print('NO') # This code is contributed # by SamyuktaSHegde |
chevron_right
filter_none
C#
// C# code to check if a two character string can // be made using given strings using System; using System.Collections.Generic; class GFG { // Function to check if str can be made using // given words static bool makeAndCheckString(List<String> words, String str) { int n = words.Count; bool first = false, second = false; for (int i = 0; i < n; i++) { // If str itself is present if (words[i] == str) return true; // Match first character of str // with second of word and vice versa if (str[0] == words[i][1]) first = true; if (str[1] == words[i][0]) second = true; // If both characters found. if (first && second) return true; } return false; } // Driver Code public static void Main(String[] args) { String str = "ya"; String[] array = { "ah", "oy", "to", "ha"}; List<String> words = new List<String>(array); if (makeAndCheckString(words, str)) Console.WriteLine("Yes"); else Console.WriteLine("No"); } } // This code is contributed by Princi Singh |
chevron_right
filter_none
PHP
<?php // PHP code to check if a two character string can // be made using given strings // Function to check if str can be made using // given words function makeAndCheckString($words, $str) { $n = sizeof($words) ; $first = false ; $second = false; for ($i = 0; $i < $n; $i++) { // If str itself is present if ($words[$i] == $str) return true; // Match first character of str // with second of word and vice versa if ($str[0] == $words[$i][1]) $first = true; if ($str[1] == $words[$i][0]) $second = true; // If both characters found. if ($first && $second) return true; } return false; } // Driver Code $str = "ya"; $words = array( "ah", "oy", "to", "ha") ; if (makeAndCheckString($words, $str)) echo "Yes"; else echo "No"; // This code is contributed by Ryuga ?> |
chevron_right
filter_none
Output:
YES
This article is contributed by Sarthak Kohli. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
Recommended Posts:
- Find the starting indices of the substrings in string (S) which is made by concatenating all words from a list(L)
- Check if the given string of words can be formed from words present in the dictionary
- Check if two strings can be made equal by swapping one character among each other
- N-th character in the string made by concatenating natural numbers
- Find the character made by adding all the characters of the given string
- Check if a string is made up of K alternating characters
- Check whether the string S1 can be made equal to S2 with the given operation
- Check if a given string is made up of two alternating characters
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Check if string can be made lexicographically smaller by reversing any substring
- Check if given words are present in a string
- Check if both halves of the string have at least one different character
- Check whether the Average Character of the String is present or not
- Check if the frequency of any character is more than half the length of the string
- Check if max occurring character of one string appears same no. of times in other
- Length of the smallest substring which contains all vowels
- Real time optimized KMP Algorithm for Pattern Searching
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Permutation of given string that maximizes count of Palindromic substrings
- Minimum length of substring whose rotation generates a palindromic substring
- Minimum number of swaps required to make the string K periodic
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- Count of distinct XORs formed by rearranging two Binary strings
- Binary string with given frequencies of sums of consecutive pairs of characters
- Minimum cost to traverse from one index to another in the String