Grokking the Coding Interview: Patterns for Coding Questions
Ask Author
Back to course home

0% completed

Word Search (medium)

Problem Statement

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

The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.

Example 1:

  • Input: word="ABCCED", board:

      { 'A', 'B', 'C', 'E' },
  { 'S', 'F', 'C', 'S' },
  { 'A', 'D', 'E', 'E' }

  • Output: true

  • Explanation: The word exists in the board:
    -> { 'A', 'B', 'C', 'E' },

.....

.....

.....

Like the course? Get enrolled and start learning!