Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Word Search

Discover how to apply backtracking and depth-first search to solve the Word Search problem on a 2D grid. This lesson guides you through checking valid paths, marking visited cells, and efficiently exploring neighbors to find a target word.

We'll cover the following...

Statement

Given an m x n grid of characters, board, and a string word, return TRUE if word exists in the grid.

The word can be formed by connecting letters of sequentially adjacent cells. The cells are considered sequentially adjacent when neighbors are either horizontally or vertically neighbors. Each cell can be used only once while forming the word.

Constraints:

  • m ==== board.length

  • n == board[i].length, where 0≤0 \leq i << m

  • ...