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

Solution: Word Search

Explore how to implement a backtracking solution using depth-first search to determine if a word exists in a 2D grid of characters. Understand managing path traversal, handling cell visitation, and pruning invalid paths to solve the word search problem effectively.

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

  • ...