In the given dictionary, a process to do a lookup in the dictionary and an M x N board where every cell has a single character. Identify all possible words that can be formed by order of adjacent characters. Consider that we can move to any of the available 8 adjacent characters, but a word should not have multiple instances of the same cell.
Example :
dictionary[] = {"FREE", "TIME", "LEARN"};
boggle[][] = {{'F', 'A', 'R'},
{'E', 'R', 'E'},
{'L', 'I', 'E'}};
isWord(str): returns true if str is present in dictionary
else false.
Output : Following words of dictionary are present FREE
