Data Structures for Coding Interviews in C++/

...

/

Solution: Word Formation Using a Hash Table

Solution: Word Formation Using a Hash Table

Let’s solve the Word Formation Using a Hash Table problem.

We'll cover the following...

Statement

Given an array of words wordsArray, determine whether a given target can be formed by combining two words from the array in any order.

Constraints:

  • 2 ≤\leq wordsArray.length ≤103\leq 10^3

  • 1 ≤\leq wordsArray[i].length ≤20\leq 20 ...