Data Structures for Coding Interviews in Java/

...

/

Solution: Word Formation From a Dictionary Using Trie

Solution: Word Formation From a Dictionary Using Trie

Let’s solve the Word Formation From a Dictionary Using Trie problem.

We'll cover the following...

Statement

Given a dictionary, find whether a given word can be formed by combining two words from the dictionary.

Constraints:

  • 0≤0 \leq dictionary ≤103\leq 10^3
  • 1≤1 \leq dictionary[i] ≤102\leq 10^2
  • 1≤1 \leq word ≤102\leq 10^2
  • word and words[i] consist of lowercase English letters
Access this course and 1400+ top-rated courses and projects.