![image](https://assets.leetcode.com/users/drpepper07/image_1573174950.png)\n\nSeems like a variant of Word search -1 and word search -2 but I haven\'t been able to come up with a better solution than brute force \n1- Generate all permutations of the dict. \n2 - Apply a generic DFS algorithm on each permutation to see which permutation consumes the max number of words from the dict\n3. return the max words consumed from a permutation. \n\nAny thoughts on a better approach?\n

\n\nSeems like a variant of Word search -1 and word search -2 but I haven\'t been able to come up with a better solution than brute force \n1- Generate all perm