Gamified challenge · DFS
board is a grid of uppercase letters, one string per row. A word is in the grid if you can spell it by starting on any cell and stepping to a cell up, down, left or right for each next letter, never using the same cell twice.
Write exists(board, word) that returns true if word is in the grid and false otherwise.
Example: for board = ["ABCE", "SFCS", "ADEE"], "ABCCED" → true and "SEE" → true, but "ABCB" → false: the only B would have to be used twice.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google