# Check if the given string of words can be formed from words present in the dictionary

Given a string array of M words and a dictionary of N words. The task is to check if the given string of words can be formed from words present in the dictionary.

Examples:

dict[] = { find, a, geeks, all, for, on, geeks, answers, inter }

Input: str[] = { “find”, “all”, “answers”, “on”, “geeks”, “for”, “geeks” };
Output: YES
all words of str[] are present in the dictionary so the output is YES

Input: str = {“find”, “a”, “geek”}
Output: NO
In str[], “find” and “a” were present in the dictionary but “geek” is not present in the dictionary so the output is NO

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

A naive Approach will be to match all words of the input sentence separately with each of the words in the dictionary and maintain a count of the number of occurrence of all words in the dictionary. So if the number of words in dictionary be n and no of words in the sentence be m this algorithm will take O(M*N) time.

A better approach will be to use the modified version of the advanced data structure Trie the time complexity can be reduced to O(M * t) where t is the length of longest word in the dictionary which is lesser than n. So here a modification has been done to the trie node such that the isEnd variable is now an integer storing the count of occurrence of the word ending on this node. Also, the search function has been modified to find a word in the trie and once found decrease the count of isEnd of that node so that for multiple occurrences of a word in a sentence each is matched with a separate occurrence of that word in the dictionary.

Below is the illustration of the above approach:

 `// C++ program to check if a sentence ` `// can be formed from a given set of words. ` `#include ` `using` `namespace` `std; ` `const` `int` `ALPHABET_SIZE = 26; ` ` `  `// here isEnd is an integer that will store ` `// count of words ending at that node ` `struct` `trieNode { ` `    ``trieNode* t[ALPHABET_SIZE]; ` `    ``int` `isEnd; ` `}; ` ` `  `// utility function to create a new node ` `trieNode* getNode() ` `{ ` `    ``trieNode* temp = ``new` `(trieNode); ` ` `  `    ``// Initialize new node with null ` `    ``for` `(``int` `i = 0; i < ALPHABET_SIZE; i++) ` `        ``temp->t[i] = NULL; ` `    ``temp->isEnd = 0; ` `    ``return` `temp; ` `} ` ` `  `// Function to insert new words in trie ` `void` `insert(trieNode* root, string key) ` `{ ` `    ``trieNode* trail; ` `    ``trail = root; ` ` `  `    ``// Iterate for the length of a word ` `    ``for` `(``int` `i = 0; i < key.length(); i++) { ` ` `  `        ``// If the next key does not contains the character ` `        ``if` `(trail->t[key[i] - ``'a'``] == NULL) { ` `            ``trieNode* temp; ` `            ``temp = getNode(); ` `            ``trail->t[key[i] - ``'a'``] = temp; ` `        ``} ` `        ``trail = trail->t[key[i] - ``'a'``]; ` `    ``} ` ` `  `    ``// isEnd is increment so not only the word but its count is also stored ` `    ``(trail->isEnd)++; ` `} ` `// Search function to find a word of a sentence ` `bool` `search_mod(trieNode* root, string word) ` `{ ` `    ``trieNode* trail; ` `    ``trail = root; ` ` `  `    ``// Iterate for the complete length of the word ` `    ``for` `(``int` `i = 0; i < word.length(); i++) { ` ` `  `        ``// If the character is not present then word ` `        ``// is also not present ` `        ``if` `(trail->t[word[i] - ``'a'``] == NULL) ` `            ``return` `false``; ` ` `  `        ``// If present move to next charater in Trie ` `        ``trail = trail->t[word[i] - ``'a'``]; ` `    ``} ` ` `  `    ``// If word foundthen decrement count of the word ` `    ``if` `((trail->isEnd) > 0 && trail != NULL) { ` `        ``// if the word is found decrement isEnd showing one ` `        ``// occurrence of this word is already taken so ` `        ``(trail->isEnd)--; ` `        ``return` `true``; ` `    ``} ` `    ``else` `        ``return` `false``; ` `} ` `// Function to check if string can be ` `// formed from the sentence ` `void` `checkPossibility(string sentence[], ``int` `m, trieNode* root) ` `{ ` `    ``int` `flag = 1; ` ` `  `    ``// Itertae for all words in the string ` `    ``for` `(``int` `i = 0; i < m; i++) { ` ` `  `        ``if` `(search_mod(root, sentence[i]) == ``false``) { ` ` `  `            ``// if a word is not found in a string then the ` `            ``// sentence cannot be made from this dictionary of words ` `            ``cout << ``"NO"``; ` ` `  `            ``return``; ` `        ``} ` `    ``} ` ` `  `    ``// If possible ` `    ``cout << ``"YES"``; ` `} ` ` `  `// Function to insert all the words of dict in the Trie ` `void` `insertToTrie(string dictionary[], ``int` `n, ` `                  ``trieNode* root) ` `{ ` ` `  `    ``for` `(``int` `i = 0; i < n; i++) ` `        ``insert(root, dictionary[i]); ` `} ` ` `  `// Driver Code ` `int` `main() ` `{ ` `    ``trieNode* root; ` `    ``root = getNode(); ` ` `  `    ``// Dictionary of words ` `    ``string dictionary[] = { ``"find"``, ``"a"``, ``"geeks"``, ` `                            ``"all"``, ``"for"``, ``"on"``, ` `                            ``"geeks"``, ``"answers"``, ``"inter"` `}; ` `    ``int` `N = ``sizeof``(dictionary) / ``sizeof``(dictionary); ` ` `  `    ``// Calling Function to insert words of dictionary to tree ` `    ``insertToTrie(dictionary, N, root); ` ` `  `    ``// String to be checked ` `    ``string sentence[] = { ``"find"``, ``"all"``, ``"answers"``, ``"on"``, ` `                          ``"geeks"``, ``"for"``, ``"geeks"` `}; ` ` `  `    ``int` `M = ``sizeof``(sentence) / ``sizeof``(sentence); ` ` `  `    ``// Function call to check possibility ` `    ``checkPossibility(sentence, M, root); ` ` `  `    ``return` `0; ` `} `

Output:

```YES
```

An efficient approach will be to use map. Keep the count of words in the map, iterate in the string and check if the word is present in the map. If present, then decrease the count of the word in the map. If it is not present, then it is not possible to make the given string from the given dictionary of words.

Below is the implementation of above approach :

## C++

 `// C++ program to check if a sentence ` `// can be formed from a given set of words. ` `#include ` `using` `namespace` `std; ` ` `  `// Function to check if the word ` `// is in the  dictionary or not ` `bool` `match_words(string dictionary[], string sentence[], ` `                 ``int` `n, ``int` `m) ` `{ ` `    ``// map to store all words in ` `    ``// dictionary with their count ` `    ``unordered_map mp; ` ` `  `    ``// adding all words in map ` `    ``for` `(``int` `i = 0; i < n; i++) { ` `        ``mp[dictionary[i]]++; ` `    ``} ` ` `  `    ``// search in map for all ` `    ``// words in the sentence ` `    ``for` `(``int` `i = 0; i < m; i++) { ` `        ``if` `(mp[sentence[i]]) ` `            ``mp[sentence[i]] -= 1; ` `        ``else` `            ``return` `false``; ` `    ``} ` ` `  `    ``// all words of sentence are present ` `    ``return` `true``; ` `} ` ` `  `// Driver Code ` `int` `main() ` `{ ` `    ``string dictionary[] = { ``"find"``, ``"a"``, ``"geeks"``, ` `                            ``"all"``, ``"for"``, ``"on"``, ` `                            ``"geeks"``, ``"answers"``, ``"inter"` `}; ` ` `  `    ``int` `n = ``sizeof``(dictionary) / ``sizeof``(dictionary); ` ` `  `    ``string sentence[] = { ``"find"``, ``"all"``, ``"answers"``, ``"on"``, ` `                          ``"geeks"``, ``"for"``, ``"geeks"` `}; ` ` `  `    ``int` `m = ``sizeof``(sentence) / ``sizeof``(sentence); ` ` `  `    ``// Calling function to check if words are ` `    ``// present in the dictionary or not ` `    ``if` `(match_words(dictionary, sentence, n, m)) ` `        ``cout << ``"YES"``; ` `    ``else` `        ``cout << ``"NO"``; ` ` `  `    ``return` `0; ` `} `

## Java

 `// Java program to check if a sentence ` `// can be formed from a given set of words. ` `import` `java.util.*; ` ` `  `class` `GFG  ` `{ ` ` `  `// Function to check if the word ` `// is in the dictionary or not ` `static` `boolean` `match_words(String dictionary[], String sentence[], ` `                                                    ``int` `n, ``int` `m) ` `{ ` `    ``// map to store all words in ` `    ``// dictionary with their count ` `    ``Map mp = ``new` `HashMap<>(); ` ` `  `    ``// adding all words in map ` `    ``for` `(``int` `i = ``0``; i < n; i++) ` `    ``{ ` `        ``if``(mp.containsKey(dictionary[i])) ` `        ``{ ` `            ``mp.put(dictionary[i], mp.get(dictionary[i])+``1``); ` `        ``} ` `        ``else` `        ``{ ` `            ``mp.put(dictionary[i], ``1``); ` `        ``} ` `    ``} ` ` `  `    ``// search in map for all ` `    ``// words in the sentence ` `    ``for` `(``int` `i = ``0``; i < m; i++)  ` `    ``{ ` `        ``if` `(mp.containsKey(sentence[i])) ` `            ``mp.put(sentence[i],mp.get(sentence[i])-``1``); ` `        ``else` `            ``return` `false``; ` `    ``} ` ` `  `    ``// all words of sentence are present ` `    ``return` `true``; ` `} ` ` `  `// Driver Code ` `public` `static` `void` `main(String[] args)  ` `{ ` `    ``String dictionary[] = { ``"find"``, ``"a"``, ``"geeks"``, ` `                            ``"all"``, ``"for"``, ``"on"``, ` `                            ``"geeks"``, ``"answers"``, ``"inter"` `}; ` ` `  `    ``int` `n = dictionary.length; ` ` `  `    ``String sentence[] = { ``"find"``, ``"all"``, ``"answers"``, ``"on"``, ` `                        ``"geeks"``, ``"for"``, ``"geeks"` `}; ` ` `  `    ``int` `m = sentence.length; ` ` `  `    ``// Calling function to check if words are ` `    ``// present in the dictionary or not ` `    ``if` `(match_words(dictionary, sentence, n, m)) ` `        ``System.out.println(``"YES"``); ` `    ``else` `        ``System.out.println(``"NO"``); ` `    ``} ` `} ` ` `  `// This code is contributed by Princi Singh `

## Python3

 `# Python3 program to check if a sentence ` `# can be formed from a given set of words. ` ` `  `# Function to check if the word ` `# is in the dictionary or not ` `def` `match_words(dictionary, sentence, n, m): ` `     `  `    ``# map to store all words in ` `    ``# dictionary with their count ` `    ``mp ``=` `dict``() ` ` `  `    ``# adding all words in map ` `    ``for` `i ``in` `range``(n): ` `        ``mp[dictionary[i]] ``=` `mp.get(dictionary[i], ``0``) ``+` `1` ` `  `    ``# search in map for all ` `    ``# words in the sentence ` `    ``for` `i ``in` `range``(m): ` `        ``if` `(mp[sentence[i]]): ` `            ``mp[sentence[i]] ``-``=` `1` `        ``else``: ` `            ``return` `False` ` `  `    ``# all words of sentence are present ` `    ``return` `True` ` `  `# Driver Code ` `dictionary ``=` `[``"find"``, ``"a"``, ``"geeks"``, ``"all"``, ``"for"``, ` `              ``"on"``, ``"geeks"``, ``"answers"``, ``"inter"``] ` ` `  `n ``=` `len``(dictionary) ` ` `  `sentence ``=` `[``"find"``, ``"all"``, ``"answers"``, ``"on"``,  ` `            ``"geeks"``, ``"for"``, ``"geeks"``] ` ` `  `m ``=` `len``(sentence) ` ` `  `# Calling function to check if words are ` `# present in the dictionary or not ` `if` `(match_words(dictionary, sentence, n, m)): ` `    ``print``(``"YES"``) ` `else``: ` `    ``print``(``"NO"``) ` ` `  `# This code is contributed by mohit kumar `

## C#

 `// C# program to check if a sentence ` `// can be formed from a given set of words. ` `using` `System; ` `using` `System.Collections.Generic;  ` `     `  `class` `GFG  ` `{ ` ` `  `// Function to check if the word ` `// is in the dictionary or not ` `static` `Boolean match_words(String []dictionary,  ` `                           ``String []sentence, ` `                           ``int` `n, ``int` `m) ` `{ ` `    ``// map to store all words in ` `    ``// dictionary with their count ` `    ``Dictionary mp = ``new` `Dictionary(); ` ` `  `    ``// adding all words in map ` `    ``for` `(``int` `i = 0; i < n; i++) ` `    ``{ ` `        ``if``(mp.ContainsKey(dictionary[i])) ` `        ``{ ` `            ``mp[dictionary[i]] = mp[dictionary[i]] + 1; ` `        ``} ` `        ``else` `        ``{ ` `            ``mp.Add(dictionary[i], 1); ` `        ``} ` `    ``} ` ` `  `    ``// search in map for all ` `    ``// words in the sentence ` `    ``for` `(``int` `i = 0; i < m; i++)  ` `    ``{ ` `        ``if` `(mp.ContainsKey(sentence[i])) ` `            ``mp[dictionary[i]] = mp[dictionary[i]] - 1; ` `        ``else` `            ``return` `false``; ` `    ``} ` ` `  `    ``// all words of sentence are present ` `    ``return` `true``; ` `} ` ` `  `// Driver Code ` `public` `static` `void` `Main(String[] args)  ` `{ ` `    ``String []dictionary = { ``"find"``, ``"a"``, ``"geeks"``, ` `                            ``"all"``, ``"for"``, ``"on"``, ` `                            ``"geeks"``, ``"answers"``, ``"inter"` `}; ` ` `  `    ``int` `n = dictionary.Length; ` ` `  `    ``String []sentence = { ``"find"``, ``"all"``, ``"answers"``, ``"on"``, ` `                          ``"geeks"``, ``"for"``, ``"geeks"` `}; ` ` `  `    ``int` `m = sentence.Length; ` ` `  `    ``// Calling function to check if words are ` `    ``// present in the dictionary or not ` `    ``if` `(match_words(dictionary, sentence, n, m)) ` `        ``Console.WriteLine(``"YES"``); ` `    ``else` `        ``Console.WriteLine(``"NO"``); ` `} ` `} ` ` `  `// This code is contributed by Rajput-Ji `

Output:

```YES
```

Time Complexity: O(M)

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

1

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.