'''
Given a dictionary, a method to do lookup in dictionary and a M x N board where every cell has one 
character. Find all possible words that can be formed by a sequence of adjacent characters. 
Note that we can move to any of 8 adjacent characters, but a word should not have multiple instances of 
same cell.

Input: dictionary[] = {"GEEKS", "FOR", "QUIZ", "GO"};
       boggle[][]   = {{'G','I','Z'},
                       {'U','E','K'},
                       {'Q','S','E'}};
      isWord(str): returns true if str is present in dictionary
                   else false.

Output:  Following words of dictionary are present
         GEEKS
         QUIZ

Amazon - I might have gotten offer if I solved this 100% correct...
'''

def Boggle(dictionary: dict, boggle: list):
    