Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Today a work mate posed a question to me.
Given a grid of characters and a list of words one would have to find every occurrence of that word in the grid both horizontally, vertically and diagonally.
The solution we came up with works and does the trick but I am interested to see how other peoples minds tick.
Insert each word in the list in a trie, or hash table or any dictionary.
Now, for each position in your grid, go horizontally, vertically and diagonally and see if you get matches in the dictionary. This should give you
O(N^3)worst case complexity, whereNis the size of the grid. Otherwise it’sO(N^2*averageWordLength)I think.