Given a 2-D grid of characters, and a list of words to be searched in this grid , output the starting indexes of grid from which each word starts. Words can be searched in all 8 directions but have to be in straight line.\nAlso it was specifically written that write optimal solution where we should not be traversing or processing grid for each word i.e suppose there are n words to be searched, you should not traverse grid n times.\nExample input:\nGrid=\n[ABCD\n GAAE\n AOTW\n ANDY]\nwords: [CAT,ANDY,DOG]\nOutput:\nCAT 0 2\nANDY 3 0\nDOG 3 2\n

Given a 2-D grid of characters, and a list of words to be searched in this grid , output the starting indexes of grid from which each word starts. Words can be 