I am studying for an interview and having trouble with this question.

Basically, you have a word that has spaces in it like c\_t.

You have a word bank and have to find all the possible words that can be made with the given string. So for in this case, if cat was in the word bank we would return true. 

Any help on solving this question (like an optimal algorithm would be appreciated).

I think we can start with checking lengths of strings in the word bank and then maybe use a hashmap somehow.