Search⌘ K
AI Features

Word Search

Explore how to apply backtracking to solve word search puzzles in grids by connecting sequentially adjacent letters. Understand constraints and implement solutions to find words in coding interviews.

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 ...