Description: Where s Waldorf?
Given a m by n grid of letters, ( 1<=m, n<=50), and a list of words, find the location in the grid at
which the word can be found. A word matches a straight, uninterrupted line of letters in the grid. A
word can match the letters in the grid regardless of case (i.e. upper and lower case letters are to be
treated as the same). The matching can be done in any of the eight directions either horizontally,
vertically or diagonally through the grid.
File list (Check if you may need any files):
10010
.....\10010 Where's Waldorf.pdf
.....\10010.cpp
.....\10010.exe
Download