Boggle

Find all possible words in a board of characters

Given a dictionary which is form of M x N board where every cell has one character.

Note that we can move to any of 8 adjacent characters, but a word should not have multiple instances of same cell.

Algorithm

•  Create visited matrix
• Iterate row from 0 to M – 1
  • Iterate col from 0 to N – 1
    • If each cel call modified DFS

Latest Source Code:
Github: Boggle.java

Output:

AMXY
CON