Given a dictionary and a list of letters find all valid words that can be built with the letters

Question

The brute force way can solve the problem in O(n!), basically calculating all the permutations and checking the results in a dictionary. I am looking for ways to improve the com

Answer 1

A better way to do this is to loop through all the words in the dictionary and see if the word can be built with the letters in the array.