1. Given 2D Matrix of characters; find whether a word is there in this array. It can start at any position and can be present horizontally, vertically and diogonally both in forward and reverse order.
2. Whats the most efficient datastructure to represent a dictionary and its operations like add, probe.
3. Extending the question above..Given a string "str" and a dictionary, one can substitute one character in the string at a time to get another string; this string should be a part of the dictionary. Start from the source string and reach the destination string "str1" in minimum number of steps.
