如何从字符数组中创建 trie 中单词的组合/排列？

Question

I have a trie that contains multiple words in it. I am attempting to create a permutation/combination of all possible words that can be found in the dictionary from an array of characters without repeats of letters in the char array. I have tried to research ideas/starting point but all the possible solutions I have found are allowing repeats, which is not what I want.

For example:

Suppose I have the words {tiptoe, top, tuple, put, pups, pop, putt } in the trie and I have the char array that contains: [t, i, p, u, l, o, e, s].

The output should be:

• top
• tuple
• put

Can someone please help me out with starting this algorithm?

Answer 1

1. iterate char array 1.a pick first char 1.b iterate word array 1.bA mark all chars in all words(only first match in a word) in word array if picked char is match with those chars.
2. Those words having all chars are marked are the output

Example first iteration:

char from char array = t;
chars marked in word array : {t`iptoe, t`op, t`uple, put`, pups, pop, put`t }