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

Solution: Word Search

Explore how to implement a backtracking approach to locate a given word in a 2D character grid. This lesson guides you through using depth-first search, handling boundary and matching conditions, and reverting visited cells to efficiently traverse all possible paths to find the 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

  • ...