Question: Would work in Java or C++ Word Seek Please read the instructions carefully at the bottom of the problem. Given a grid of letters, find
Word Seek Please read the instructions carefully at the bottom of the problem. Given a grid of letters, find the words in the grid The letters can be in any of the 8 directions from the first character of the word. All words might not be in the grid. Print the word and the start row and column position for each word that is found For words that are not found, print -1 for both the row and column postion. All indices start from Sample Input- Here is a 4x4 grid of letters as sample input. The grid is followed the by the words to find after a blanik line. All characters will be in upper case. ABCD PRAT KITA ANDY ANDY CAT DOG Sample Output ANDY 3 0 CAT 0 2 DOG-1-1 Another example: TRAP CARD FACT
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
