Boggle Game
Method 1 : Trie Tree for dictionary
1) create TrieTree for all words need to be searched
2) do dfs on character matrix.
case 1: current path is not in trie tree(prefixWith), return.
case 2: found a complete path in trie tree(ends with leaf word), add to result, return