Challenge: Word Formation from a Given Dictionary Using a Trie

Problem Statement

In this problem, you have to implement the isFormationPossible() function to find whether or not the given word can be formed by combining two words from the dictionary.

Function Prototype:

boolean isFormationPossible(String[] dict, String word);

Here, dict is the dictionary containing unique strings, and word is a string.

Output:

It returns true if the given word can be generated by combining two words from the given dictionary; otherwise, it returns false.

Sample Input

String dict[] = {"the" ,"hello", "there", "answer", "any", "Dragon", 
                 "world", "their", "inc"};

String word = "helloworld"

Sample Output

true

Explanation

helloworld can be formed by combining hello and world from the “dictionary”, so the program returns true.

Here’s an illustration of the given challenge: