Google | Onsite | MTV

  • Location: Mountain View
  • YOE: 1
  • Position: SDE

On a 4x4 board,

[‘E’, ‘G’, ‘O’, ‘O’]
[‘A’, ‘P’, ‘E’, ‘G’]
[‘T’, ‘E’, ‘P’, ‘L’]
[‘C’, ‘N’, ‘E’, ‘I’]

find words that can be formed by a sequence of adjacent (top, bottom, left, right, diagonal) letters.
Words must be 3 or more letters.
You may move to any of 8 adjacent letters, however, a word should not have multiple instances of the same cell.

  • The above is an example board. Your solution should accept any board layout of letters.
  • To check if a string is a valid word you may implement a naive dictionary solution for simplicity.