Round 1: HackerEarth
1) Given MxN keypad of characters and word. determine if it is possible to type word without lifting finger. Finger can only glide with adjacent keys who share common edges.
2) Given a language rules in the form of 26X26 matrix, where matrix[i][j] denotes, (j-'a')th character can occur after (i-'a')th character.
Determine how many unique possible strings of length 'n' can be generated?
