All of you guys must have played a game in which a 2-D Matrix of characters is given. The goal to find words which satisfy some criteria (eg. Names of various countries etc...) The words can be present horizontally, vertically and diogonally both in forward and reverse order. This is a pretty tough problem. Lets restrict our current problem to a single word. Given a matrix of characters (2-D array of characters) find the number of occurrence of a word in that matrix. The word can be present in 1. Row 2. Coloum 3. Diagonally.
In all three cases, the word can be present both in forward and reverse manner. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
