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

Solution: Word Search

Explore how to implement a backtracking solution for the word search problem in a 2D grid. Understand how to apply depth-first search to check sequential adjacency and backtrack when paths fail. This lesson helps you master traversing grids efficiently and managing state to find words while optimizing time and space complexity.

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

  • ...